./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/a.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 5b7c2858314131c244395f9ab37913061eb343a6 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:46:58,236 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:46:58,239 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:46:58,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:46:58,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:46:58,262 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:46:58,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:46:58,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:46:58,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:46:58,272 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:46:58,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:46:58,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:46:58,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:46:58,280 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:46:58,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:46:58,290 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:46:58,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:46:58,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:46:58,299 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:46:58,304 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:46:58,306 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:46:58,307 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:46:58,312 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:46:58,313 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:46:58,313 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:46:58,314 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:46:58,315 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:46:58,318 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:46:58,320 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:46:58,322 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:46:58,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:46:58,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:46:58,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:46:58,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:46:58,328 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:46:58,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:46:58,330 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:46:58,361 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:46:58,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:46:58,363 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:46:58,364 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:46:58,364 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:46:58,364 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:46:58,365 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:46:58,366 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:46:58,366 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:46:58,366 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:46:58,366 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:46:58,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:46:58,367 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:46:58,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:46:58,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:46:58,368 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:46:58,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:46:58,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:46:58,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:46:58,368 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:46:58,370 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:46:58,371 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:46:58,371 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:46:58,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:46:58,371 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:46:58,371 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:46:58,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:46:58,372 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:46:58,373 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:46:58,374 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 -> 5b7c2858314131c244395f9ab37913061eb343a6 [2019-01-01 21:46:58,438 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:46:58,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:46:58,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:46:58,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:46:58,467 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:46:58,469 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:46:58,539 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ef5b055/3ecd8d44c2694c178c2657a675e69322/FLAG30adb6a7a [2019-01-01 21:46:59,043 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:46:59,044 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/a.07-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:46:59,059 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ef5b055/3ecd8d44c2694c178c2657a675e69322/FLAG30adb6a7a [2019-01-01 21:46:59,358 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ef5b055/3ecd8d44c2694c178c2657a675e69322 [2019-01-01 21:46:59,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:46:59,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:46:59,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:46:59,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:46:59,368 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:46:59,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:46:59" (1/1) ... [2019-01-01 21:46:59,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6b9528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:46:59, skipping insertion in model container [2019-01-01 21:46:59,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:46:59" (1/1) ... [2019-01-01 21:46:59,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:46:59,428 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:46:59,824 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:46:59,838 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:46:59,989 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:00,062 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:47:00,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00 WrapperNode [2019-01-01 21:47:00,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:00,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:00,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:47:00,064 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:47:00,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:00,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:47:00,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:47:00,135 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:47:00,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (1/1) ... [2019-01-01 21:47:00,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:47:00,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:47:00,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:47:00,171 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:47:00,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (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-01 21:47:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:47:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:47:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:47:00,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:47:00,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:47:00,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:47:00,577 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:47:00,578 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:47:00,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:00 BoogieIcfgContainer [2019-01-01 21:47:00,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:47:00,579 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:47:00,579 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:47:00,594 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:47:00,595 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:00,599 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:46:59" (1/3) ... [2019-01-01 21:47:00,600 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@323f1bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:00, skipping insertion in model container [2019-01-01 21:47:00,600 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:00,602 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:00" (2/3) ... [2019-01-01 21:47:00,605 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@323f1bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:00, skipping insertion in model container [2019-01-01 21:47:00,605 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:00,605 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:00" (3/3) ... [2019-01-01 21:47:00,607 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.07-alloca_true-termination_true-no-overflow.c.i [2019-01-01 21:47:00,733 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:47:00,734 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:47:00,734 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:47:00,734 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:47:00,734 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:47:00,735 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:47:00,735 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:47:00,735 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:47:00,735 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:47:00,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:47:00,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:47:00,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:00,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:00,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:47:00,780 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:00,780 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:47:00,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:47:00,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:47:00,781 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:00,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:00,782 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:47:00,782 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:00,790 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-01 21:47:00,791 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_~y_ref~0.base, test_fun_~y_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_~x_ref~0.base, test_fun_~x_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~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem11, 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_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem12; 6#L557-5true [2019-01-01 21:47:00,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:00,797 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:47:00,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:00,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:00,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:01,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:01,057 INFO L82 PathProgramCache]: Analyzing trace with hash 36846, now seen corresponding path program 1 times [2019-01-01 21:47:01,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:01,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:01,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:01,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:01,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:01,108 INFO L82 PathProgramCache]: Analyzing trace with hash 28695788, now seen corresponding path program 1 times [2019-01-01 21:47:01,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:01,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:01,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:01,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:01,826 WARN L181 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-01-01 21:47:02,086 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-01 21:47:03,352 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 128 DAG size of output: 116 [2019-01-01 21:47:03,789 WARN L181 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-01 21:47:03,814 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:03,816 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:03,816 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:03,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:03,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:03,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:03,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:03,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:03,818 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.07-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2019-01-01 21:47:03,818 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:03,818 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:03,861 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-01 21:47:03,881 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-01 21:47:03,898 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-01 21:47:03,904 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-01 21:47:03,909 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-01 21:47:03,911 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-01 21:47:03,915 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-01 21:47:03,923 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-01 21:47:03,928 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-01 21:47:03,939 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-01 21:47:03,942 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-01 21:47:03,948 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-01 21:47:03,950 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-01 21:47:03,954 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-01 21:47:05,022 WARN L181 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-01-01 21:47:05,246 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-01-01 21:47:05,246 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-01 21:47:05,250 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-01 21:47:05,252 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-01 21:47:05,257 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-01 21:47:05,264 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-01 21:47:05,606 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-01-01 21:47:05,802 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-01-01 21:47:07,389 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-01 21:47:07,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:07,647 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:07,649 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-01 21:47:07,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,660 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-01 21:47:07,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:07,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:07,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,671 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-01 21:47:07,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,676 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-01 21:47:07,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,681 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-01 21:47:07,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,687 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-01 21:47:07,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,690 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-01 21:47:07,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,693 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-01 21:47:07,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:07,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:07,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,707 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-01 21:47:07,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,713 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-01 21:47:07,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:07,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:07,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,733 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-01 21:47:07,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:07,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:07,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,748 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-01 21:47:07,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,759 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-01 21:47:07,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:07,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:07,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:07,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,766 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-01 21:47:07,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:07,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:07,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:07,786 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-01 21:47:07,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:07,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:07,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:07,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:07,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:07,799 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:07,845 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:07,873 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:07,873 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:07,877 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:07,878 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:47:07,879 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:07,880 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -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*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-01-01 21:47:08,228 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-01-01 21:47:08,240 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:08,241 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:08,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:08,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:08,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:08,575 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-01-01 21:47:08,661 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-01 21:47:08,677 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-01 21:47:08,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2019-01-01 21:47:08,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 38 states and 44 transitions. Complement of second has 9 states. [2019-01-01 21:47:08,804 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-01 21:47:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:47:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2019-01-01 21:47:08,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-01 21:47:08,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:08,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:47:08,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:08,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:47:08,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:08,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 44 transitions. [2019-01-01 21:47:08,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:47:08,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 12 states and 15 transitions. [2019-01-01 21:47:08,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:47:08,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:47:08,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2019-01-01 21:47:08,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:08,823 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2019-01-01 21:47:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2019-01-01 21:47:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-01 21:47:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:47:08,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-01 21:47:08,851 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:47:08,851 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:47:08,851 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:47:08,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2019-01-01 21:47:08,852 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:47:08,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:08,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:08,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:47:08,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:08,855 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 258#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); 259#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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 262#L557-1 [2019-01-01 21:47:08,855 INFO L796 eck$LassoCheckResult]: Loop: 262#L557-1 assume !test_fun_#t~short10; 265#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem11, 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_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem12; 261#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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 262#L557-1 [2019-01-01 21:47:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:08,855 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:47:08,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:08,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:08,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:08,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:08,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash 41888, now seen corresponding path program 1 times [2019-01-01 21:47:08,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:08,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:08,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:08,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:08,942 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-01 21:47:08,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:47:08,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:47:08,947 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:47:08,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:47:08,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:47:08,951 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:47:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:47:08,975 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-01 21:47:08,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:47:08,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-01 21:47:08,978 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:08,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-01 21:47:08,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:47:08,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:47:08,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:47:08,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:08,979 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:08,979 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:08,979 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:08,979 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:47:08,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:47:08,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:08,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:47:08,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:47:08 BoogieIcfgContainer [2019-01-01 21:47:08,987 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:47:08,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:47:08,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:47:08,988 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:47:08,990 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:00" (3/4) ... [2019-01-01 21:47:08,994 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:47:08,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:47:08,996 INFO L168 Benchmark]: Toolchain (without parser) took 9633.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 954.0 MB in the beginning and 788.9 MB in the end (delta: 165.1 MB). Peak memory consumption was 356.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:08,997 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:08,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:08,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:08,999 INFO L168 Benchmark]: Boogie Preprocessor took 35.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:09,001 INFO L168 Benchmark]: RCFGBuilder took 407.53 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:09,002 INFO L168 Benchmark]: BuchiAutomizer took 8408.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 788.9 MB in the end (delta: 283.0 MB). Peak memory consumption was 361.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:09,003 INFO L168 Benchmark]: Witness Printer took 6.95 ms. Allocated memory is still 1.2 GB. Free memory is still 788.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:09,009 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 699.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -142.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.79 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 407.53 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8408.37 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 788.9 MB in the end (delta: 283.0 MB). Peak memory consumption was 361.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.95 ms. Allocated memory is still 1.2 GB. Free memory is still 788.9 MB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] 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 8.2s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 7.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. 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 11 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 11 SDtfs, 10 SDslu, 10 SDs, 0 SdLazy, 23 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 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...