./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 14310793a2daa3bf62d53b5cef67b6406903d242 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:39,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:39,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:39,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:39,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:39,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:39,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:39,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:39,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:39,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:39,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:39,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:39,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:39,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:39,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:39,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:39,574 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:39,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:39,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:39,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:39,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:39,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:39,593 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:39,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:39,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:39,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:39,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:39,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:39,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:39,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:39,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:39,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:39,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:39,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:39,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:39,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:39,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:39,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:39,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:39,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:39,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:39,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:39,649 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:39,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:39,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:39,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:39,651 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:39,651 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:39,651 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:39,652 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:39,652 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:39,652 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:39,652 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:39,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:39,653 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:39,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:39,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:39,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:39,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:39,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:39,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:39,654 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:39,654 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:39,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:39,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:39,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:39,655 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:39,655 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:39,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:39,656 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:39,656 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:39,657 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:39,657 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14310793a2daa3bf62d53b5cef67b6406903d242 [2020-07-29 01:34:39,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:40,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:40,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:40,017 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:40,018 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:40,019 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2020-07-29 01:34:40,080 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a66068955/82c54222819645f59b4afecc014ed91d/FLAG6d5bf7a0a [2020-07-29 01:34:40,542 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:40,543 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2020-07-29 01:34:40,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a66068955/82c54222819645f59b4afecc014ed91d/FLAG6d5bf7a0a [2020-07-29 01:34:40,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a66068955/82c54222819645f59b4afecc014ed91d [2020-07-29 01:34:40,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:40,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:40,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:40,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:40,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:40,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:40" (1/1) ... [2020-07-29 01:34:40,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b6fd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:40, skipping insertion in model container [2020-07-29 01:34:40,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:40" (1/1) ... [2020-07-29 01:34:40,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:40,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:41,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:41,358 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:41,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:41,491 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:41,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41 WrapperNode [2020-07-29 01:34:41,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:41,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:41,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:41,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:41,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:41,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:41,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:41,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:41,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,572 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... [2020-07-29 01:34:41,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:41,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:41,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:41,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:41,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:41,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:41,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:41,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:42,041 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:42,042 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:34:42,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:42 BoogieIcfgContainer [2020-07-29 01:34:42,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:42,046 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:42,046 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:42,050 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:42,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:42,051 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:40" (1/3) ... [2020-07-29 01:34:42,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c4c0b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:42, skipping insertion in model container [2020-07-29 01:34:42,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:42,052 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:41" (2/3) ... [2020-07-29 01:34:42,052 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c4c0b87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:42, skipping insertion in model container [2020-07-29 01:34:42,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:42,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:42" (3/3) ... [2020-07-29 01:34:42,054 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.14-alloca.i [2020-07-29 01:34:42,110 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:42,110 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:42,110 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:42,110 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:42,111 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:42,111 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:42,111 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:42,111 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:42,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:42,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:42,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:42,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:42,149 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:42,149 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:42,149 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:42,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 01:34:42,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:42,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:42,153 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:42,153 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:42,153 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:42,160 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L556-4true [2020-07-29 01:34:42,160 INFO L796 eck$LassoCheckResult]: Loop: 6#L556-4true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 14#L555-1true assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 7#L555-3true assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 4#L556-3true assume !true; 6#L556-4true [2020-07-29 01:34:42,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:42,167 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:34:42,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:42,177 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721878903] [2020-07-29 01:34:42,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,389 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:42,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1142256, now seen corresponding path program 1 times [2020-07-29 01:34:42,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:42,391 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204284452] [2020-07-29 01:34:42,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:42,446 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#true} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; {18#true} is VALID [2020-07-29 01:34:42,446 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#true} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; {18#true} is VALID [2020-07-29 01:34:42,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {18#true} assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; {18#true} is VALID [2020-07-29 01:34:42,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {18#true} assume !true; {19#false} is VALID [2020-07-29 01:34:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:42,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204284452] [2020-07-29 01:34:42,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:42,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-29 01:34:42,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752719659] [2020-07-29 01:34:42,458 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:42,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:42,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:34:42,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:34:42,472 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-29 01:34:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:42,548 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 01:34:42,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:34:42,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:34:42,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:42,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2020-07-29 01:34:42,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:42,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 9 transitions. [2020-07-29 01:34:42,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:34:42,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:34:42,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2020-07-29 01:34:42,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:42,583 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:34:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2020-07-29 01:34:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:34:42,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:42,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:34:42,611 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:34:42,613 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 7 states. [2020-07-29 01:34:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:42,614 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2020-07-29 01:34:42,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:34:42,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:42,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:42,616 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 9 transitions. [2020-07-29 01:34:42,616 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 9 transitions. [2020-07-29 01:34:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:42,617 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2020-07-29 01:34:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:34:42,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:42,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:42,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:42,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:42,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:34:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:34:42,620 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:34:42,621 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:34:42,621 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:42,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:34:42,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:42,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:42,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:42,622 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:42,622 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:42,623 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 32#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L556-4 [2020-07-29 01:34:42,623 INFO L796 eck$LassoCheckResult]: Loop: 33#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 37#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 38#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 34#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 35#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 33#L556-4 [2020-07-29 01:34:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2020-07-29 01:34:42,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:42,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534856890] [2020-07-29 01:34:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:42,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:42,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:42,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 35409745, now seen corresponding path program 1 times [2020-07-29 01:34:42,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:42,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048785673] [2020-07-29 01:34:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:42,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {58#true} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; {60#(or (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not |ULTIMATE.start_test_fun_#t~short8|))} is VALID [2020-07-29 01:34:42,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {60#(or (= (select (select |#memory_int| ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset) (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not |ULTIMATE.start_test_fun_#t~short8|))} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; {61#(or (not |ULTIMATE.start_test_fun_#t~short8|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} is VALID [2020-07-29 01:34:42,823 INFO L280 TraceCheckUtils]: 2: Hoare triple {61#(or (not |ULTIMATE.start_test_fun_#t~short8|) (<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)))} assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; {62#(<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:42,825 INFO L280 TraceCheckUtils]: 3: Hoare triple {62#(<= 1 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {63#(<= 1 |ULTIMATE.start_test_fun_#t~mem9|)} is VALID [2020-07-29 01:34:42,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {63#(<= 1 |ULTIMATE.start_test_fun_#t~mem9|)} assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; {59#false} is VALID [2020-07-29 01:34:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:42,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048785673] [2020-07-29 01:34:42,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:42,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:34:42,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884930603] [2020-07-29 01:34:42,828 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:42,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:34:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:34:42,831 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 6 states. [2020-07-29 01:34:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:43,064 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:34:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:34:43,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:34:43,074 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:43,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2020-07-29 01:34:43,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:43,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2020-07-29 01:34:43,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:34:43,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:34:43,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2020-07-29 01:34:43,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:43,078 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:34:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2020-07-29 01:34:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-29 01:34:43,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:43,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 11 transitions. Second operand 9 states. [2020-07-29 01:34:43,080 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 11 transitions. Second operand 9 states. [2020-07-29 01:34:43,080 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 9 states. [2020-07-29 01:34:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:43,081 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:34:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:34:43,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:43,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:43,082 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states and 11 transitions. [2020-07-29 01:34:43,082 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states and 11 transitions. [2020-07-29 01:34:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:43,083 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2020-07-29 01:34:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:34:43,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:43,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:43,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:43,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:43,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:34:43,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-07-29 01:34:43,086 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:34:43,086 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 01:34:43,086 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:43,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-07-29 01:34:43,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:34:43,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:43,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:43,088 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:34:43,088 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:34:43,088 INFO L794 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 79#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 80#L556-4 [2020-07-29 01:34:43,088 INFO L796 eck$LassoCheckResult]: Loop: 80#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 84#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 85#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 81#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 82#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 86#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 87#L556-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 80#L556-4 [2020-07-29 01:34:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:43,089 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2020-07-29 01:34:43,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:43,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208196420] [2020-07-29 01:34:43,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,164 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,177 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:43,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:43,179 INFO L82 PathProgramCache]: Analyzing trace with hash -330970762, now seen corresponding path program 1 times [2020-07-29 01:34:43,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:43,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744474598] [2020-07-29 01:34:43,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,240 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2020-07-29 01:34:43,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:43,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899235544] [2020-07-29 01:34:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:43,308 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:43,321 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:43,606 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2020-07-29 01:34:44,104 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2020-07-29 01:34:44,271 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-07-29 01:34:44,287 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:44,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:44,289 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:44,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:44,289 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:44,290 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:44,290 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:44,290 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:44,290 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.14-alloca.i_Iteration3_Lasso [2020-07-29 01:34:44,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:44,291 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:44,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:44,898 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2020-07-29 01:34:45,096 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2020-07-29 01:34:45,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:45,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:46,070 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:46,075 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,088 INFO L120 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-07-29 01:34:46,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,126 INFO L120 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-07-29 01:34:46,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,155 INFO L120 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-07-29 01:34:46,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,187 INFO L120 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-07-29 01:34:46,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,229 INFO L120 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-07-29 01:34:46,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,255 INFO L120 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-07-29 01:34:46,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:46,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:46,263 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,289 INFO L120 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-07-29 01:34:46,292 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,294 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,294 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:46,318 INFO L120 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 Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,360 INFO L120 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-07-29 01:34:46,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,386 INFO L120 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-07-29 01:34:46,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:46,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:46,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,421 INFO L120 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-07-29 01:34:46,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,446 INFO L120 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-07-29 01:34:46,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:46,451 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:46,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,484 INFO L120 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-07-29 01:34:46,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,511 INFO L120 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-07-29 01:34:46,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:46,516 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:46,522 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,552 INFO L120 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-07-29 01:34:46,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:46,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:46,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:46,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,581 INFO L120 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-07-29 01:34:46,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:46,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:46,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:46,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:46,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:46,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:46,608 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:46,638 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:34:46,638 INFO L444 ModelExtractionUtils]: 10 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:46,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:46,651 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:46,652 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:46,653 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:46,820 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:34:46,826 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6;" "assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0;" "assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;" "call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12;" "call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;" [2020-07-29 01:34:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:46,842 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:46,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:46,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:46,916 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {115#unseeded} is VALID [2020-07-29 01:34:46,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {115#unseeded} havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {115#unseeded} is VALID [2020-07-29 01:34:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:46,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:34:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:46,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:46,996 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-29 01:34:47,034 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:47,037 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:47,038 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:47,038 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2020-07-29 01:34:47,042 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:47,043 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|]. (let ((.cse0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))) (and (>= oldRank0 .cse0) (<= |ULTIMATE.start_test_fun_#t~mem9| .cse0))) [2020-07-29 01:34:47,043 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (<= |ULTIMATE.start_test_fun_#t~mem9| oldRank0) [2020-07-29 01:34:47,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {118#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; {118#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:47,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; {118#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:47,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {118#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; {118#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} is VALID [2020-07-29 01:34:47,130 INFO L280 TraceCheckUtils]: 3: Hoare triple {118#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset))} call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {265#(<= |ULTIMATE.start_test_fun_#t~mem9| oldRank0)} is VALID [2020-07-29 01:34:47,132 INFO L280 TraceCheckUtils]: 4: Hoare triple {265#(<= |ULTIMATE.start_test_fun_#t~mem9| oldRank0)} assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; {269#(<= 1 oldRank0)} is VALID [2020-07-29 01:34:47,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {269#(<= 1 oldRank0)} call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {273#(and (<= 1 oldRank0) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem9|))} is VALID [2020-07-29 01:34:47,134 INFO L280 TraceCheckUtils]: 6: Hoare triple {273#(and (<= 1 oldRank0) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) |ULTIMATE.start_test_fun_#t~mem9|))} assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; {248#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:34:47,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:47,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:34:47,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:47,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:47,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,157 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:34:47,158 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 6 states. [2020-07-29 01:34:47,414 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 16 states and 21 transitions. Complement of second has 10 states. [2020-07-29 01:34:47,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:47,415 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:47,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. cyclomatic complexity: 3 [2020-07-29 01:34:47,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:47,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:47,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:34:47,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:47,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:47,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:47,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:34:47,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:47,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:47,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:47,426 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 3 [2020-07-29 01:34:47,427 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:34:47,428 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:34:47,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:34:47,429 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:47,430 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:47,430 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:47,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:47,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:47,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:47,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:47,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:47,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:47,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:34:47,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:34:47,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:34:47,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:47,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:47,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:34:47,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:47,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:47,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:34:47,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:47,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:47,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:47,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:47,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:47,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 7 letters. [2020-07-29 01:34:47,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:47,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:47,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 7 letters. [2020-07-29 01:34:47,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:34:47,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:34:47,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 7 letters. [2020-07-29 01:34:47,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:47,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:47,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 7 letters. [2020-07-29 01:34:47,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:34:47,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:34:47,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:34:47,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:47,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:47,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 5 letters. [2020-07-29 01:34:47,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:34:47,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:34:47,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:34:47,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:47,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,451 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:34:47,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2020-07-29 01:34:47,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 7 letters. [2020-07-29 01:34:47,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:34:47,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 14 letters. [2020-07-29 01:34:47,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:47,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 21 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:47,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:47,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 21 transitions. [2020-07-29 01:34:47,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:34:47,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:34:47,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-07-29 01:34:47,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:47,457 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 01:34:47,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-07-29 01:34:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-07-29 01:34:47,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:47,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand 14 states. [2020-07-29 01:34:47,459 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand 14 states. [2020-07-29 01:34:47,459 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 14 states. [2020-07-29 01:34:47,460 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:47,462 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 01:34:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:34:47,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:47,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:47,463 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 16 states and 21 transitions. [2020-07-29 01:34:47,463 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 16 states and 21 transitions. [2020-07-29 01:34:47,464 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:47,465 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 01:34:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 01:34:47,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:47,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:47,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:47,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:47,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:34:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-07-29 01:34:47,468 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:34:47,468 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:34:47,468 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:34:47,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:34:47,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:47,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:47,469 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:47,469 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:47,469 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:34:47,470 INFO L794 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 311#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 312#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 321#L555-1 assume !test_fun_#t~short8; 318#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 313#L556-3 [2020-07-29 01:34:47,470 INFO L796 eck$LassoCheckResult]: Loop: 313#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 314#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 313#L556-3 [2020-07-29 01:34:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:47,470 INFO L82 PathProgramCache]: Analyzing trace with hash 28695850, now seen corresponding path program 1 times [2020-07-29 01:34:47,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:47,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249247196] [2020-07-29 01:34:47,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:47,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {390#true} is VALID [2020-07-29 01:34:47,500 INFO L280 TraceCheckUtils]: 1: Hoare triple {390#true} havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {390#true} is VALID [2020-07-29 01:34:47,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {390#true} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; {390#true} is VALID [2020-07-29 01:34:47,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {390#true} assume !test_fun_#t~short8; {392#(not |ULTIMATE.start_test_fun_#t~short8|)} is VALID [2020-07-29 01:34:47,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {392#(not |ULTIMATE.start_test_fun_#t~short8|)} assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; {391#false} is VALID [2020-07-29 01:34:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:47,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249247196] [2020-07-29 01:34:47,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:47,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:34:47,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038978521] [2020-07-29 01:34:47,503 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:34:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2020-07-29 01:34:47,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:47,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82028388] [2020-07-29 01:34:47,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:47,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:47,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:47,519 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:47,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:47,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:34:47,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:34:47,688 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:34:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:47,716 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-29 01:34:47,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:34:47,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:34:47,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:47,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. [2020-07-29 01:34:47,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:47,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 17 transitions. [2020-07-29 01:34:47,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:34:47,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:34:47,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2020-07-29 01:34:47,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:47,728 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 01:34:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2020-07-29 01:34:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-29 01:34:47,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:47,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 17 transitions. Second operand 14 states. [2020-07-29 01:34:47,730 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 17 transitions. Second operand 14 states. [2020-07-29 01:34:47,730 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand 14 states. [2020-07-29 01:34:47,730 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:47,731 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-29 01:34:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-29 01:34:47,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:47,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:47,732 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states and 17 transitions. [2020-07-29 01:34:47,733 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states and 17 transitions. [2020-07-29 01:34:47,733 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:47,735 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2020-07-29 01:34:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-07-29 01:34:47,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:47,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:47,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:47,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:34:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2020-07-29 01:34:47,737 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 01:34:47,737 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2020-07-29 01:34:47,737 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:34:47,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2020-07-29 01:34:47,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:47,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:47,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:47,739 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:47,739 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:34:47,740 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 411#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 412#L556-4 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; 419#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; 421#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; 413#L556-3 [2020-07-29 01:34:47,740 INFO L796 eck$LassoCheckResult]: Loop: 413#L556-3 call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 414#L556-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; 413#L556-3 [2020-07-29 01:34:47,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:47,740 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2020-07-29 01:34:47,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:47,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354530908] [2020-07-29 01:34:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:47,767 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:47,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:47,802 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:47,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:47,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2020-07-29 01:34:47,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:47,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428152806] [2020-07-29 01:34:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:47,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:47,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:47,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:47,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2020-07-29 01:34:47,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:47,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682027033] [2020-07-29 01:34:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:47,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:47,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:47,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:48,417 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 94 [2020-07-29 01:34:48,584 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-07-29 01:34:48,589 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:48,589 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:48,589 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:48,589 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:48,589 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:48,589 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:48,589 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:48,590 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:48,590 INFO L133 ssoRankerPreferences]: Filename of dumped script: b.14-alloca.i_Iteration5_Lasso [2020-07-29 01:34:48,590 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:48,590 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:48,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:48,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,033 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-07-29 01:34:49,181 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2020-07-29 01:34:49,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:49,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:50,161 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:50,162 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,169 INFO L120 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-07-29 01:34:50,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,170 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:50,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:50,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:50,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,197 INFO L120 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-07-29 01:34:50,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,205 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,233 INFO L120 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-07-29 01:34:50,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:50,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,235 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:50,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:50,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,259 INFO L120 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-07-29 01:34:50,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,262 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,262 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:50,307 INFO L120 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 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:50,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:50,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:50,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,332 INFO L120 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-07-29 01:34:50,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,337 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,337 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,368 INFO L120 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-07-29 01:34:50,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,417 INFO L120 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-07-29 01:34:50,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,447 INFO L120 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-07-29 01:34:50,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:50,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:50,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:50,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:50,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:50,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:50,473 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:50,526 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-07-29 01:34:50,526 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:50,530 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:50,533 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:50,533 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:50,533 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2020-07-29 01:34:50,674 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:34:50,678 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);" "assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12;" [2020-07-29 01:34:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,683 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:34:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:50,760 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2020-07-29 01:34:50,764 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:34:50,769 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:34:50,775 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:34:50,775 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2020-07-29 01:34:50,777 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:34:50,777 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_124|, |ULTIMATE.start_test_fun_#t~malloc2.base|]. (and (<= (select (store (store |v_#valid_124| |ULTIMATE.start_test_fun_#t~malloc2.base| 1) ULTIMATE.start_test_fun_~y_ref~0.base 1) ULTIMATE.start_test_fun_~c~0.base) 0) unseeded) [2020-07-29 01:34:50,777 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded) [2020-07-29 01:34:50,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {496#unseeded} is VALID [2020-07-29 01:34:50,783 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#unseeded} havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem9, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); {630#(and (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:50,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {630#(and (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 == test_fun_#t~mem6; {630#(and (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:50,785 INFO L280 TraceCheckUtils]: 3: Hoare triple {630#(and (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 > 0; {630#(and (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:50,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {630#(and (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7; {630#(and (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) unseeded)} is VALID [2020-07-29 01:34:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:34:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:50,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:50,829 INFO L280 TraceCheckUtils]: 0: Hoare triple {631#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); {651#(and (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:34:50,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {651#(and (<= |ULTIMATE.start_test_fun_#t~mem9| (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset) oldRank0))} assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~c~0.base, test_fun_~c~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~c~0.base, test_fun_~c~0.offset, 4);havoc test_fun_#t~mem12; {633#(and (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)) (>= oldRank0 0)) unseeded) (not (= ULTIMATE.start_test_fun_~y_ref~0.base ULTIMATE.start_test_fun_~c~0.base)))} is VALID [2020-07-29 01:34:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:50,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:34:50,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:50,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:50,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,845 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:34:50,846 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:34:50,932 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 17 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 32 states and 37 transitions. Complement of second has 7 states. [2020-07-29 01:34:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:50,932 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:50,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:34:50,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:50,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:50,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:34:50,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:50,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:50,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:50,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2020-07-29 01:34:50,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:50,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:50,936 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:34:50,937 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:50,937 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:34:50,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:34:50,938 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:50,939 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 37 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:50,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:50,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:50,939 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:34:50,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:50,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:50,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:50,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:34:50,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:34:50,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:34:50,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:34:50,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:34:50,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 7 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:34:50,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:50,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:50,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:50,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:50,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:50,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:34:50,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:50,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:50,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:50,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:50,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:50,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:50,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:34:50,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:34:50,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:34:50,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,949 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:34:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2020-07-29 01:34:50,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:50,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:50,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:50,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:50,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:50,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:50,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2020-07-29 01:34:50,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:34:50,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:34:50,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:34:50,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:50,954 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:50,955 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:50,955 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:50,955 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:34:50,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:34:50,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:50,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:50,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:34:50 BoogieIcfgContainer [2020-07-29 01:34:50,962 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:34:50,962 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:34:50,962 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:34:50,963 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:34:50,963 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:42" (3/4) ... [2020-07-29 01:34:50,967 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:34:50,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:34:50,969 INFO L168 Benchmark]: Toolchain (without parser) took 10051.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.1 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -175.6 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:50,969 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:50,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:50,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:50,971 INFO L168 Benchmark]: Boogie Preprocessor took 31.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:50,972 INFO L168 Benchmark]: RCFGBuilder took 468.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:50,974 INFO L168 Benchmark]: BuchiAutomizer took 8916.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -107.4 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:50,974 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:50,978 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 573.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.26 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 468.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8916.12 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -107.4 MB). Peak memory consumption was 68.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (3 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 36 SDtfs, 18 SDslu, 21 SDs, 0 SdLazy, 63 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital440 mio100 ax104 hnf99 lsp94 ukn42 mio100 lsp36 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms 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! Received shutdown request...