YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 05:35:56,630 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 05:35:56,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 05:35:56,643 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 05:35:56,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 05:35:56,644 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 05:35:56,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 05:35:56,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 05:35:56,648 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 05:35:56,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 05:35:56,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 05:35:56,650 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 05:35:56,651 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 05:35:56,652 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 05:35:56,653 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 05:35:56,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 05:35:56,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 05:35:56,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 05:35:56,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 05:35:56,659 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 05:35:56,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 05:35:56,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 05:35:56,663 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 05:35:56,663 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 05:35:56,664 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 05:35:56,664 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 05:35:56,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 05:35:56,665 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 05:35:56,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 05:35:56,666 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 05:35:56,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 05:35:56,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 05:35:56,668 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 05:35:56,669 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 05:35:56,669 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 05:35:56,669 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 05:35:56,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 05:35:56,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 05:35:56,671 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 05:35:56,671 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 05:35:56,686 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 05:35:56,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 05:35:56,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 05:35:56,688 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 05:35:56,688 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 05:35:56,688 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:35:56,688 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 05:35:56,688 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 05:35:56,689 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 05:35:56,689 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 05:35:56,689 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 05:35:56,689 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 05:35:56,689 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 05:35:56,689 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 05:35:56,690 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 05:35:56,690 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 05:35:56,690 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 05:35:56,690 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 05:35:56,690 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 05:35:56,691 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 05:35:56,691 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 05:35:56,691 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 05:35:56,691 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 05:35:56,691 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 05:35:56,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:35:56,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 05:35:56,692 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 05:35:56,692 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 05:35:56,692 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 05:35:56,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 05:35:56,730 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 05:35:56,733 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 05:35:56,735 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 05:35:56,735 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 05:35:56,736 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:35:56,872 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/2807dde310c04d60b1e739895538bb4b/FLAG21c7e5abb [2020-06-22 05:35:57,218 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 05:35:57,219 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 05:35:57,219 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 05:35:57,225 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/2807dde310c04d60b1e739895538bb4b/FLAG21c7e5abb [2020-06-22 05:35:57,611 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/2807dde310c04d60b1e739895538bb4b [2020-06-22 05:35:57,623 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 05:35:57,624 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 05:35:57,625 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 05:35:57,626 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 05:35:57,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 05:35:57,630 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1eafb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57, skipping insertion in model container [2020-06-22 05:35:57,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 05:35:57,659 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 05:35:57,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:35:57,897 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 05:35:57,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 05:35:57,930 INFO L195 MainTranslator]: Completed translation [2020-06-22 05:35:57,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57 WrapperNode [2020-06-22 05:35:57,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 05:35:57,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 05:35:57,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 05:35:57,932 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 05:35:57,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 05:35:57,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 05:35:57,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 05:35:57,969 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 05:35:57,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... [2020-06-22 05:35:57,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 05:35:57,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 05:35:57,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 05:35:57,989 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 05:35:57,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 05:35:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 05:35:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 05:35:58,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 05:35:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 05:35:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 05:35:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure strlen_rec [2020-06-22 05:35:58,058 INFO L138 BoogieDeclarations]: Found implementation of procedure strlen_rec [2020-06-22 05:35:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 05:35:58,236 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 05:35:58,236 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2020-06-22 05:35:58,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:35:58 BoogieIcfgContainer [2020-06-22 05:35:58,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 05:35:58,238 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 05:35:58,238 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 05:35:58,241 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 05:35:58,241 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:35:58" (1/1) ... [2020-06-22 05:35:58,259 INFO L313 BlockEncoder]: Initial Icfg 21 locations, 23 edges [2020-06-22 05:35:58,260 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 05:35:58,261 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 05:35:58,262 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 05:35:58,262 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 05:35:58,264 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 05:35:58,265 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 05:35:58,265 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 05:35:58,283 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 05:35:58,303 INFO L200 BlockEncoder]: SBE split 6 edges [2020-06-22 05:35:58,308 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:35:58,310 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:35:58,328 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 05:35:58,330 INFO L70 RemoveSinkStates]: Removed 2 edges and 2 locations by removing sink states [2020-06-22 05:35:58,332 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 05:35:58,332 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 05:35:58,333 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 05:35:58,333 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 05:35:58,334 INFO L313 BlockEncoder]: Encoded RCFG 16 locations, 24 edges [2020-06-22 05:35:58,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:35:58 BasicIcfg [2020-06-22 05:35:58,334 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 05:35:58,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 05:35:58,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 05:35:58,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 05:35:58,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 05:35:57" (1/4) ... [2020-06-22 05:35:58,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3cbb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:35:58, skipping insertion in model container [2020-06-22 05:35:58,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (2/4) ... [2020-06-22 05:35:58,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3cbb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 05:35:58, skipping insertion in model container [2020-06-22 05:35:58,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:35:58" (3/4) ... [2020-06-22 05:35:58,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3cbb8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:35:58, skipping insertion in model container [2020-06-22 05:35:58,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:35:58" (4/4) ... [2020-06-22 05:35:58,343 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:35:58,353 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 05:35:58,360 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-06-22 05:35:58,376 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-06-22 05:35:58,405 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:35:58,406 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 05:35:58,406 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 05:35:58,406 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:35:58,406 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:35:58,406 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:35:58,406 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 05:35:58,406 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:35:58,407 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 05:35:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-06-22 05:35:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 05:35:58,428 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:35:58,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 05:35:58,429 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:35:58,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash 3208906, now seen corresponding path program 1 times [2020-06-22 05:35:58,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:58,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:58,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:58,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:35:58,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 05:35:58,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 05:35:58,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:35:58,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:35:58,621 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2020-06-22 05:35:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:35:58,699 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2020-06-22 05:35:58,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:35:58,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 05:35:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:35:58,711 INFO L225 Difference]: With dead ends: 16 [2020-06-22 05:35:58,711 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 05:35:58,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:35:58,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 05:35:58,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 05:35:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 05:35:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2020-06-22 05:35:58,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 18 transitions. Word has length 4 [2020-06-22 05:35:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:35:58,752 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 18 transitions. [2020-06-22 05:35:58,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 05:35:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 18 transitions. [2020-06-22 05:35:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 05:35:58,753 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:35:58,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 05:35:58,753 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:35:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash 3208908, now seen corresponding path program 1 times [2020-06-22 05:35:58,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:58,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:58,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:58,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:35:58,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 05:35:58,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 05:35:58,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 05:35:58,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 05:35:58,790 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. Second operand 4 states. [2020-06-22 05:35:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:35:58,836 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-06-22 05:35:58,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 05:35:58,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 05:35:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:35:58,837 INFO L225 Difference]: With dead ends: 13 [2020-06-22 05:35:58,838 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 05:35:58,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 05:35:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 05:35:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 05:35:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 05:35:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-06-22 05:35:58,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 4 [2020-06-22 05:35:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:35:58,843 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-06-22 05:35:58,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 05:35:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-06-22 05:35:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 05:35:58,843 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:35:58,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 05:35:58,844 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:35:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 3208909, now seen corresponding path program 1 times [2020-06-22 05:35:58,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:58,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:58,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:58,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:58,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:35:58,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 05:35:58,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 05:35:58,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 05:35:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:35:58,874 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 3 states. [2020-06-22 05:35:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:35:58,905 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-06-22 05:35:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 05:35:58,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 05:35:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:35:58,906 INFO L225 Difference]: With dead ends: 12 [2020-06-22 05:35:58,906 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 05:35:58,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 05:35:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 05:35:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 05:35:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 05:35:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-06-22 05:35:58,910 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 16 transitions. Word has length 4 [2020-06-22 05:35:58,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:35:58,910 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-06-22 05:35:58,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 05:35:58,910 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-06-22 05:35:58,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 05:35:58,911 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:35:58,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:35:58,911 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:35:58,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:58,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1106378170, now seen corresponding path program 1 times [2020-06-22 05:35:58,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:58,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:58,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:35:58,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 05:35:58,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 05:35:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 05:35:58,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 05:35:58,957 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 5 states. [2020-06-22 05:35:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:35:59,017 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-06-22 05:35:59,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 05:35:59,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-06-22 05:35:59,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:35:59,018 INFO L225 Difference]: With dead ends: 11 [2020-06-22 05:35:59,018 INFO L226 Difference]: Without dead ends: 10 [2020-06-22 05:35:59,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 05:35:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-06-22 05:35:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-06-22 05:35:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-06-22 05:35:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2020-06-22 05:35:59,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 7 [2020-06-22 05:35:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:35:59,022 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-06-22 05:35:59,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 05:35:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-06-22 05:35:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 05:35:59,023 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:35:59,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:35:59,023 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:35:59,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1106378172, now seen corresponding path program 1 times [2020-06-22 05:35:59,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:59,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:35:59,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 05:35:59,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 05:35:59,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 05:35:59,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 05:35:59,111 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2020-06-22 05:35:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:35:59,193 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-06-22 05:35:59,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 05:35:59,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2020-06-22 05:35:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:35:59,194 INFO L225 Difference]: With dead ends: 15 [2020-06-22 05:35:59,195 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 05:35:59,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:35:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 05:35:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-06-22 05:35:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 05:35:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-06-22 05:35:59,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2020-06-22 05:35:59,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:35:59,200 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-06-22 05:35:59,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 05:35:59,200 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-06-22 05:35:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 05:35:59,200 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:35:59,200 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:35:59,201 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:35:59,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:59,201 INFO L82 PathProgramCache]: Analyzing trace with hash -678559379, now seen corresponding path program 1 times [2020-06-22 05:35:59,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:59,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:59,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:59,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:59,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 05:35:59,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 05:35:59,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 05:35:59,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:35:59,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:35:59,348 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. [2020-06-22 05:35:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:35:59,481 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-06-22 05:35:59,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 05:35:59,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-06-22 05:35:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:35:59,482 INFO L225 Difference]: With dead ends: 23 [2020-06-22 05:35:59,482 INFO L226 Difference]: Without dead ends: 12 [2020-06-22 05:35:59,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-06-22 05:35:59,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-06-22 05:35:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-06-22 05:35:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 05:35:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-06-22 05:35:59,487 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 11 [2020-06-22 05:35:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:35:59,487 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-06-22 05:35:59,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 05:35:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2020-06-22 05:35:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 05:35:59,488 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:35:59,488 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:35:59,488 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:35:59,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:35:59,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1661126904, now seen corresponding path program 1 times [2020-06-22 05:35:59,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:35:59,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:35:59,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:59,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:35:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:35:59,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:35:59,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:35:59,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:35:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:35:59,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 22 conjunts are in the unsatisfiable core [2020-06-22 05:35:59,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:35:59,809 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 05:35:59,809 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:35:59,816 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:35:59,817 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:35:59,817 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 05:35:59,844 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 05:35:59,844 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:35:59,847 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:35:59,848 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:35:59,848 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 05:35:59,925 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:35:59,925 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 05:35:59,929 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 05:35:59,939 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:35:59,939 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:35:59,939 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 05:36:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:36:00,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:36:00,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 05:36:00,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 05:36:00,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 05:36:00,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2020-06-22 05:36:00,047 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand 17 states. [2020-06-22 05:36:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:36:00,611 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-06-22 05:36:00,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-06-22 05:36:00,612 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 11 [2020-06-22 05:36:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:36:00,612 INFO L225 Difference]: With dead ends: 22 [2020-06-22 05:36:00,612 INFO L226 Difference]: Without dead ends: 21 [2020-06-22 05:36:00,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2020-06-22 05:36:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-06-22 05:36:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2020-06-22 05:36:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 05:36:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-06-22 05:36:00,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 11 [2020-06-22 05:36:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:36:00,618 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 05:36:00,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 05:36:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-06-22 05:36:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 05:36:00,618 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:36:00,619 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:36:00,619 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:36:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1661126903, now seen corresponding path program 1 times [2020-06-22 05:36:00,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:00,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:36:00,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:36:00,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:36:00,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:00,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:36:00,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:36:00,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 05:36:00,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2020-06-22 05:36:00,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 05:36:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 05:36:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 05:36:00,757 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 8 states. [2020-06-22 05:36:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:36:00,819 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2020-06-22 05:36:00,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 05:36:00,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-06-22 05:36:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:36:00,820 INFO L225 Difference]: With dead ends: 18 [2020-06-22 05:36:00,820 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 05:36:00,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-06-22 05:36:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 05:36:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-06-22 05:36:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 05:36:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-06-22 05:36:00,824 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2020-06-22 05:36:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:36:00,825 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-06-22 05:36:00,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 05:36:00,825 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-06-22 05:36:00,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 05:36:00,825 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 05:36:00,826 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 05:36:00,826 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, strlen_recErr1REQUIRES_VIOLATION, strlen_recErr0REQUIRES_VIOLATION]=== [2020-06-22 05:36:00,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:00,826 INFO L82 PathProgramCache]: Analyzing trace with hash -595318504, now seen corresponding path program 1 times [2020-06-22 05:36:00,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:00,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:00,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:00,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:36:01,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 05:36:01,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 05:36:01,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:01,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 05:36:01,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:01,121 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 05:36:01,121 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:36:01,125 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:36:01,126 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:36:01,126 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 05:36:01,130 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 05:36:01,131 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 05:36:01,133 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:36:01,133 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:36:01,133 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 05:36:01,195 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:36:01,195 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-06-22 05:36:01,197 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 05:36:01,206 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 05:36:01,206 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 05:36:01,206 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-06-22 05:36:01,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 05:36:01,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 05:36:01,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2020-06-22 05:36:01,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 05:36:01,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 05:36:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-06-22 05:36:01,279 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 16 states. [2020-06-22 05:36:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 05:36:02,195 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-06-22 05:36:02,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-06-22 05:36:02,196 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2020-06-22 05:36:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 05:36:02,196 INFO L225 Difference]: With dead ends: 33 [2020-06-22 05:36:02,196 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 05:36:02,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2020-06-22 05:36:02,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 05:36:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 05:36:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 05:36:02,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 05:36:02,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-06-22 05:36:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 05:36:02,200 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:36:02,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 05:36:02,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:36:02,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 05:36:02,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 05:36:02,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 05:36:02,866 WARN L188 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 55 [2020-06-22 05:36:02,869 INFO L444 ceAbstractionStarter]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_main_~nondetString1~0.base))) (and (<= 1 ULTIMATE.start_main_~length1~0) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= ULTIMATE.start_main_~nondetString1~0.offset 0) (= ULTIMATE.start_main_~length1~0 .cse0) (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse0 (- 1))) 0))) [2020-06-22 05:36:02,869 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-06-22 05:36:02,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 05:36:02,870 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 16) no Hoare annotation was computed. [2020-06-22 05:36:02,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 05:36:02,870 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 05:36:02,870 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 05:36:02,870 INFO L448 ceAbstractionStarter]: For program point strlen_recFINAL(lines 5 10) no Hoare annotation was computed. [2020-06-22 05:36:02,870 INFO L444 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: (let ((.cse6 (select |#length| strlen_rec_~p.base)) (.cse3 (select |#memory_int| |strlen_rec_#in~p.base|)) (.cse4 (select |#length| |strlen_rec_#in~p.base|))) (let ((.cse0 (not (= |strlen_rec_#in~p.offset| 0))) (.cse1 (not (= (select |#valid| |strlen_rec_#in~p.base|) 1))) (.cse5 (not (= (select .cse3 (+ .cse4 (- 1))) 0))) (.cse2 (not (<= 1 .cse4))) (.cse8 (= 1 (select |#valid| strlen_rec_~p.base))) (.cse7 (= (select (select |#memory_int| strlen_rec_~p.base) (+ .cse6 (- 1))) 0))) (and (or .cse0 .cse1 .cse2 (not (= 0 (select .cse3 |strlen_rec_#in~p.offset|)))) (or (not (<= (+ |strlen_rec_#in~p.offset| 1) .cse4)) .cse1 (not (<= 1 |strlen_rec_#in~p.offset|)) .cse5 (and (<= (+ strlen_rec_~p.offset 2) .cse6) (<= 1 strlen_rec_~p.offset) .cse7 .cse8)) (or .cse0 .cse1 .cse5 .cse2 (and (and (= 0 strlen_rec_~p.offset) (let ((.cse9 (+ strlen_rec_~p.offset 1))) (and (not (= .cse6 .cse9)) (<= .cse9 .cse6) .cse8))) .cse7))))) [2020-06-22 05:36:02,871 INFO L451 ceAbstractionStarter]: At program point strlen_recENTRY(lines 5 10) the Hoare annotation is: true [2020-06-22 05:36:02,871 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2020-06-22 05:36:02,871 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2020-06-22 05:36:02,871 INFO L448 ceAbstractionStarter]: For program point L6-1(lines 6 9) no Hoare annotation was computed. [2020-06-22 05:36:02,871 INFO L448 ceAbstractionStarter]: For program point strlen_recErr0REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 05:36:02,871 INFO L448 ceAbstractionStarter]: For program point strlen_recEXIT(lines 5 10) no Hoare annotation was computed. [2020-06-22 05:36:02,871 INFO L448 ceAbstractionStarter]: For program point strlen_recErr1REQUIRES_VIOLATION(line 6) no Hoare annotation was computed. [2020-06-22 05:36:02,872 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 05:36:02,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:36:02 BasicIcfg [2020-06-22 05:36:02,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 05:36:02,876 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 05:36:02,876 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 05:36:02,879 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 05:36:02,880 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:36:02,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 05:35:57" (1/5) ... [2020-06-22 05:36:02,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50408b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:36:02, skipping insertion in model container [2020-06-22 05:36:02,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:36:02,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 05:35:57" (2/5) ... [2020-06-22 05:36:02,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50408b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 05:36:02, skipping insertion in model container [2020-06-22 05:36:02,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:36:02,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 05:35:58" (3/5) ... [2020-06-22 05:36:02,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50408b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:36:02, skipping insertion in model container [2020-06-22 05:36:02,882 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:36:02,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 05:35:58" (4/5) ... [2020-06-22 05:36:02,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50408b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:36:02, skipping insertion in model container [2020-06-22 05:36:02,883 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 05:36:02,883 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 05:36:02" (5/5) ... [2020-06-22 05:36:02,884 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 05:36:02,906 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 05:36:02,906 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 05:36:02,906 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 05:36:02,907 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 05:36:02,907 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 05:36:02,907 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 05:36:02,907 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 05:36:02,907 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 05:36:02,907 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 05:36:02,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-06-22 05:36:02,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:36:02,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:36:02,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:36:02,922 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 05:36:02,922 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:36:02,922 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 05:36:02,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-06-22 05:36:02,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-06-22 05:36:02,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 05:36:02,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 05:36:02,924 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 05:36:02,924 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 05:36:02,929 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue [75] ULTIMATE.startENTRY-->L14: Formula: (and (= |v_#NULL.offset_2| 0) (= (store |v_#valid_12| 0 0) |v_#valid_11|) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_5|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_3|, #valid=|v_#valid_11|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret4=|v_ULTIMATE.start_main_#t~ret4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString1~0.offset, #NULL.offset, ULTIMATE.start_main_#t~malloc3.offset, #NULL.base, ULTIMATE.start_main_#t~ret4] 17#L14true [56] L14-->L14-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 14#L14-2true [63] L14-2-->L18: Formula: (and (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc3.base_2|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc3.base_2| v_ULTIMATE.start_main_~length1~0_7) |v_#length_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc3.base_2|) 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc3.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc3.base_2| |v_#StackHeapBarrier_1|)) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_2|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, #length, ULTIMATE.start_main_#t~malloc3.offset] 7#L18true [35] L18-->L18-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (<= .cse0 (select |v_#length_3| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (= 1 (select |v_#valid_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_3|} AuxVars[] AssignedVars[#memory_int] 4#L18-1true [34] L18-1-->strlen_recENTRY: Formula: (and (= |v_strlen_rec_#in~p.baseInParam_1| v_ULTIMATE.start_main_~nondetString1~0.base_7) (= |v_strlen_rec_#in~p.offsetInParam_1| v_ULTIMATE.start_main_~nondetString1~0.offset_6)) InVars {ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7} OutVars{strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offsetInParam_1|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.baseInParam_1|} AuxVars[] AssignedVars[strlen_rec_#in~p.offset, strlen_rec_#in~p.base]< 3#strlen_recENTRYtrue [2020-06-22 05:36:02,930 INFO L796 eck$LassoCheckResult]: Loop: 3#strlen_recENTRYtrue [33] strlen_recENTRY-->L6: Formula: (and (= v_strlen_rec_~p.offset_1 |v_strlen_rec_#in~p.offset_1|) (= v_strlen_rec_~p.base_1 |v_strlen_rec_#in~p.base_1|)) InVars {strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offset_1|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.base_1|} OutVars{strlen_rec_~p.base=v_strlen_rec_~p.base_1, strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offset_1|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_1, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.base_1|} AuxVars[] AssignedVars[strlen_rec_~p.offset, strlen_rec_~p.base] 12#L6true [42] L6-->L6-1: Formula: (and (= 1 (select |v_#valid_9| v_strlen_rec_~p.base_2)) (<= (+ v_strlen_rec_~p.offset_2 1) (select |v_#length_5| v_strlen_rec_~p.base_2)) (= |v_strlen_rec_#t~mem0_1| (select (select |v_#memory_int_3| v_strlen_rec_~p.base_2) v_strlen_rec_~p.offset_2)) (<= 0 v_strlen_rec_~p.offset_2)) InVars {#memory_int=|v_#memory_int_3|, strlen_rec_~p.base=v_strlen_rec_~p.base_2, #length=|v_#length_5|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_2, #valid=|v_#valid_9|} OutVars{strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_1|, strlen_rec_~p.offset=v_strlen_rec_~p.offset_2, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, strlen_rec_~p.base=v_strlen_rec_~p.base_2, #length=|v_#length_5|} AuxVars[] AssignedVars[strlen_rec_#t~mem0] 13#L6-1true [73] L6-1-->L9: Formula: (> |v_strlen_rec_#t~mem0_5| 0) InVars {strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_5|} OutVars{strlen_rec_#t~mem0=|v_strlen_rec_#t~mem0_4|} AuxVars[] AssignedVars[strlen_rec_#t~mem0] 15#L9true [49] L9-->strlen_recENTRY: Formula: (and (= |v_strlen_rec_#in~p.baseInParam_2| v_strlen_rec_~p.base_6) (= |v_strlen_rec_#in~p.offsetInParam_2| (+ v_strlen_rec_~p.offset_5 1))) InVars {strlen_rec_~p.offset=v_strlen_rec_~p.offset_5, strlen_rec_~p.base=v_strlen_rec_~p.base_6} OutVars{strlen_rec_#in~p.offset=|v_strlen_rec_#in~p.offsetInParam_2|, strlen_rec_#in~p.base=|v_strlen_rec_#in~p.baseInParam_2|} AuxVars[] AssignedVars[strlen_rec_#in~p.offset, strlen_rec_#in~p.base]< 3#strlen_recENTRYtrue [2020-06-22 05:36:02,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash 99623184, now seen corresponding path program 1 times [2020-06-22 05:36:02,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:02,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:02,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:02,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:02,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1949298, now seen corresponding path program 1 times [2020-06-22 05:36:02,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:02,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:02,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:02,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:02,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:02,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1609089025, now seen corresponding path program 1 times [2020-06-22 05:36:02,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 05:36:02,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 05:36:02,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:02,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 05:36:02,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 05:36:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:03,300 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 05:36:03,301 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 05:36:03,302 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 05:36:03,302 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 05:36:03,302 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 05:36:03,302 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 05:36:03,302 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 05:36:03,302 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 05:36:03,302 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 05:36:03,303 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 05:36:03,303 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 05:36:03,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 05:36:03,612 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 05:36:03,618 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 05:36:03,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:03,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:03,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:03,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:03,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:03,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:03,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:03,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:03,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:03,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:03,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:03,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:03,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:03,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:03,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:03,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:03,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:03,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:03,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:36:03,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:36:03,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:03,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:03,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:03,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:36:03,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:36:03,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:36:03,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:36:03,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 05:36:03,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 05:36:03,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 05:36:03,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 05:36:03,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 05:36:03,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 05:36:03,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 05:36:03,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 05:36:03,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 05:36:03,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 05:36:03,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 05:36:03,694 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 05:36:03,713 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 05:36:03,714 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 05:36:03,717 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 05:36:03,718 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 05:36:03,718 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 05:36:03,719 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length strlen_rec_#in~p.base)_1, strlen_rec_#in~p.offset) = 1*v_rep(select #length strlen_rec_#in~p.base)_1 - 1*strlen_rec_#in~p.offset Supporting invariants [] [2020-06-22 05:36:03,734 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-06-22 05:36:03,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 05:36:03,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 05:36:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:03,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 05:36:03,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 05:36:03,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 05:36:03,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 05:36:03,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 05:36:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 05:36:03,857 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 05:36:03,857 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 05:36:03,860 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 05:36:03,861 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states. Second operand 4 states. [2020-06-22 05:36:03,968 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states.. Second operand 4 states. Result 49 states and 69 transitions. Complement of second has 15 states. [2020-06-22 05:36:03,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 05:36:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 05:36:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-06-22 05:36:03,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2020-06-22 05:36:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2020-06-22 05:36:03,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:03,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2020-06-22 05:36:03,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 05:36:03,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 69 transitions. [2020-06-22 05:36:03,989 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:36:03,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2020-06-22 05:36:03,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 05:36:03,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 05:36:03,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 05:36:03,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 05:36:03,991 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:36:03,991 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:36:03,991 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 05:36:03,992 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 05:36:03,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 05:36:03,992 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 05:36:03,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 05:36:03,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 05:36:03 BasicIcfg [2020-06-22 05:36:03,998 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 05:36:03,998 INFO L168 Benchmark]: Toolchain (without parser) took 6374.91 ms. Allocated memory was 649.6 MB in the beginning and 770.7 MB in the end (delta: 121.1 MB). Free memory was 565.0 MB in the beginning and 489.6 MB in the end (delta: 75.5 MB). Peak memory consumption was 196.6 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:03,999 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 05:36:04,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.65 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 564.0 MB in the beginning and 649.9 MB in the end (delta: -85.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:04,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.76 ms. Allocated memory is still 684.7 MB. Free memory was 649.9 MB in the beginning and 647.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:04,001 INFO L168 Benchmark]: Boogie Preprocessor took 20.01 ms. Allocated memory is still 684.7 MB. Free memory was 647.6 MB in the beginning and 646.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:04,001 INFO L168 Benchmark]: RCFGBuilder took 249.14 ms. Allocated memory is still 684.7 MB. Free memory was 646.5 MB in the beginning and 628.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:04,002 INFO L168 Benchmark]: BlockEncodingV2 took 96.37 ms. Allocated memory is still 684.7 MB. Free memory was 628.7 MB in the beginning and 622.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:04,002 INFO L168 Benchmark]: TraceAbstraction took 4539.47 ms. Allocated memory was 684.7 MB in the beginning and 770.7 MB in the end (delta: 86.0 MB). Free memory was 622.2 MB in the beginning and 645.1 MB in the end (delta: -22.9 MB). Peak memory consumption was 316.9 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:04,003 INFO L168 Benchmark]: BuchiAutomizer took 1122.40 ms. Allocated memory is still 770.7 MB. Free memory was 645.1 MB in the beginning and 489.6 MB in the end (delta: 155.6 MB). Peak memory consumption was 155.6 MB. Max. memory is 50.3 GB. [2020-06-22 05:36:04,007 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 21 locations, 23 edges - StatisticsResult: Encoded RCFG 16 locations, 24 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 305.65 ms. Allocated memory was 649.6 MB in the beginning and 684.7 MB in the end (delta: 35.1 MB). Free memory was 564.0 MB in the beginning and 649.9 MB in the end (delta: -85.9 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 36.76 ms. Allocated memory is still 684.7 MB. Free memory was 649.9 MB in the beginning and 647.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 20.01 ms. Allocated memory is still 684.7 MB. Free memory was 647.6 MB in the beginning and 646.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 249.14 ms. Allocated memory is still 684.7 MB. Free memory was 646.5 MB in the beginning and 628.7 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 96.37 ms. Allocated memory is still 684.7 MB. Free memory was 628.7 MB in the beginning and 622.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4539.47 ms. Allocated memory was 684.7 MB in the beginning and 770.7 MB in the end (delta: 86.0 MB). Free memory was 622.2 MB in the beginning and 645.1 MB in the end (delta: -22.9 MB). Peak memory consumption was 316.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1122.40 ms. Allocated memory is still 770.7 MB. Free memory was 645.1 MB in the beginning and 489.6 MB in the end (delta: 155.6 MB). Peak memory consumption was 155.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 4 error locations. SAFE Result, 4.4s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 104 SDslu, 162 SDs, 0 SdLazy, 615 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 27 PreInvPairs, 39 NumberOfFragments, 179 HoareAnnotationTreeSize, 27 FomulaSimplifications, 5569 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1965 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 8237 SizeOfPredicates, 18 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 6/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[p] + -1 * p and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 49 SDslu, 10 SDs, 0 SdLazy, 39 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp93 ukn63 mio100 lsp54 div100 bol100 ite100 ukn100 eq162 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 05:35:54.326 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 05:36:04.246 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check