./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.07-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/termination-memory-alloca/b.07-alloca_true-termination_true-no-overflow.c.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 d098d694ac70f506ee7e05c2de50965e1598d96f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:30:30,594 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:30:30,596 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:30:30,610 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:30:30,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:30:30,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:30:30,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:30:30,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:30:30,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:30:30,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:30:30,620 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:30:30,621 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:30:30,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:30:30,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:30:30,625 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:30:30,626 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:30:30,627 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:30:30,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:30:30,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:30:30,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:30:30,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:30:30,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:30:30,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:30:30,641 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:30:30,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:30:30,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:30:30,643 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:30:30,644 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:30:30,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:30:30,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:30:30,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:30:30,648 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:30:30,648 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:30:30,648 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:30:30,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:30:30,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:30:30,651 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:30:30,675 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:30:30,677 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:30:30,679 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:30:30,680 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:30:30,680 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:30:30,680 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:30:30,680 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:30:30,680 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:30:30,683 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:30:30,683 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:30:30,683 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:30:30,683 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:30:30,684 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:30:30,684 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:30:30,684 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:30:30,685 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:30:30,685 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:30:30,685 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:30:30,685 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:30:30,685 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:30:30,685 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:30:30,686 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:30:30,688 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:30:30,688 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:30:30,688 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:30:30,688 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:30:30,689 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:30:30,689 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:30:30,690 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:30:30,690 INFO L133 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 -> d098d694ac70f506ee7e05c2de50965e1598d96f [2019-01-14 02:30:30,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:30:30,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:30:30,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:30:30,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:30:30,768 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:30:30,769 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.07-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:30,838 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9a4d54d/8889e08f5c52416eba981904d2daafb2/FLAGadb771785 [2019-01-14 02:30:31,343 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:30:31,344 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.07-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:31,360 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9a4d54d/8889e08f5c52416eba981904d2daafb2/FLAGadb771785 [2019-01-14 02:30:31,646 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e9a4d54d/8889e08f5c52416eba981904d2daafb2 [2019-01-14 02:30:31,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:30:31,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:30:31,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:31,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:30:31,657 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:30:31,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:31" (1/1) ... [2019-01-14 02:30:31,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42621528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:31, skipping insertion in model container [2019-01-14 02:30:31,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:31" (1/1) ... [2019-01-14 02:30:31,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:30:31,728 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:30:32,213 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:32,234 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:30:32,315 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:32,451 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:30:32,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32 WrapperNode [2019-01-14 02:30:32,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:32,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:32,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:30:32,454 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:30:32,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,485 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:32,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:30:32,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:30:32,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:30:32,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (1/1) ... [2019-01-14 02:30:32,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:30:32,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:30:32,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:30:32,565 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:30:32,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (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 [2019-01-14 02:30:32,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:30:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:30:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:30:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:30:32,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:30:32,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:30:33,053 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:30:33,053 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:30:33,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:33 BoogieIcfgContainer [2019-01-14 02:30:33,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:30:33,056 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:30:33,056 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:30:33,060 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:30:33,061 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:33,061 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:30:31" (1/3) ... [2019-01-14 02:30:33,064 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bfb9447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:33, skipping insertion in model container [2019-01-14 02:30:33,064 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:33,064 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:32" (2/3) ... [2019-01-14 02:30:33,065 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bfb9447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:33, skipping insertion in model container [2019-01-14 02:30:33,065 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:33,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:33" (3/3) ... [2019-01-14 02:30:33,069 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.07-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:33,131 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:30:33,132 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:30:33,132 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:30:33,132 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:30:33,133 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:30:33,133 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:30:33,133 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:30:33,133 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:30:33,133 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:30:33,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-14 02:30:33,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:30:33,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:33,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:33,178 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:33,179 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:30:33,179 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:30:33,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-14 02:30:33,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:30:33,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:33,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:33,181 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:33,181 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:30:33,192 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 6#L557-5true [2019-01-14 02:30:33,193 INFO L796 eck$LassoCheckResult]: Loop: 6#L557-5true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 8#L557-1true assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 6#L557-5true [2019-01-14 02:30:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:30:33,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:33,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:33,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:33,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:33,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash 36846, now seen corresponding path program 1 times [2019-01-14 02:30:33,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:33,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:33,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:33,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:33,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:33,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:33,471 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-01-14 02:30:33,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:33,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:33,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:34,334 WARN L181 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-14 02:30:35,732 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2019-01-14 02:30:36,227 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-14 02:30:36,250 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:36,251 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:36,251 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:36,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:36,252 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:36,252 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:36,252 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:36,252 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:36,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.07-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2019-01-14 02:30:36,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:36,253 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:36,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:36,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:37,824 WARN L181 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-01-14 02:30:38,041 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-01-14 02:30:38,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:38,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:38,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:38,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:38,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:38,441 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-14 02:30:38,644 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 02:30:40,255 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:30:40,483 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:30:40,489 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:30:40,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:40,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:40,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:40,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:40,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:40,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:40,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:40,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:40,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:30:40,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:30:40,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:30:40,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:40,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:40,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:30:40,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:30:40,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:30:40,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:30:40,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:30:40,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:30:40,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:30:40,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:30:40,684 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:30:40,767 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2019-01-14 02:30:40,767 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:30:40,771 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:30:40,773 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:30:40,773 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:30:40,775 INFO L520 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, ULTIMATE.start_test_fun_~z) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 - 1*ULTIMATE.start_test_fun_~z Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 - 1*ULTIMATE.start_test_fun_~z >= 0] [2019-01-14 02:30:41,189 INFO L297 tatePredicateManager]: 41 out of 42 supporting invariants were superfluous and have been removed [2019-01-14 02:30:41,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:30:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:41,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:41,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:30:41,733 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2019-01-14 02:30:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:41,750 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:30:41,752 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2019-01-14 02:30:41,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 43 states and 48 transitions. Complement of second has 10 states. [2019-01-14 02:30:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:30:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:30:41,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-14 02:30:41,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:30:41,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:41,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:30:41,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:41,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:30:41,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:30:41,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 48 transitions. [2019-01-14 02:30:41,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:30:41,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 11 states and 14 transitions. [2019-01-14 02:30:41,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:30:41,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:30:41,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 02:30:41,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:30:41,969 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:30:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 02:30:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:30:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:30:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:30:42,001 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:30:42,001 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:30:42,001 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:30:42,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:30:42,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:30:42,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:42,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:42,004 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:30:42,004 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:30:42,006 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 273#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 274#L557-5 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 280#L557-1 assume !test_fun_#t~short10; 281#L557-3 [2019-01-14 02:30:42,006 INFO L796 eck$LassoCheckResult]: Loop: 281#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 276#L557-5 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 277#L557-1 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 281#L557-3 [2019-01-14 02:30:42,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:42,007 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-14 02:30:42,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:42,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:42,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:42,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:42,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:42,119 INFO L82 PathProgramCache]: Analyzing trace with hash 47316, now seen corresponding path program 2 times [2019-01-14 02:30:42,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:42,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:42,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:42,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908301, now seen corresponding path program 1 times [2019-01-14 02:30:42,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:42,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:42,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:42,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:30:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:30:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:30:42,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:30:42,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:30:42,604 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-01-14 02:30:42,780 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:30:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:30:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:30:42,786 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:30:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:30:42,806 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-01-14 02:30:42,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:30:42,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-01-14 02:30:42,809 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:42,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 0 states and 0 transitions. [2019-01-14 02:30:42,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:30:42,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:30:42,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:30:42,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:30:42,811 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:42,811 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:42,811 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:30:42,811 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:30:42,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:30:42,811 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:30:42,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:30:42,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:30:42 BoogieIcfgContainer [2019-01-14 02:30:42,820 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:30:42,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:30:42,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:30:42,821 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:30:42,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:33" (3/4) ... [2019-01-14 02:30:42,825 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:30:42,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:30:42,826 INFO L168 Benchmark]: Toolchain (without parser) took 11175.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.9 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -301.3 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:42,828 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:42,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:42,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:42,830 INFO L168 Benchmark]: Boogie Preprocessor took 47.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:42,832 INFO L168 Benchmark]: RCFGBuilder took 492.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:42,833 INFO L168 Benchmark]: BuchiAutomizer took 9764.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:30:42,834 INFO L168 Benchmark]: Witness Printer took 4.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:30:42,841 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 799.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.01 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 492.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9764.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -151.1 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * z and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 16 SDslu, 10 SDs, 0 SdLazy, 24 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital450 mio100 ax103 hnf100 lsp93 ukn53 mio100 lsp37 div100 bol100 ite100 ukn100 eq190 hnf88 smp91 dnf642 smp90 tf100 neg91 sie127 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...