./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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.13-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 72925b65ef321f719f00e79529e35268c3f3eaa3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:47,330 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:47,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:47,345 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:47,349 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:47,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:47,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:47,355 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:47,359 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:47,363 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:47,364 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:47,365 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:47,366 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:47,367 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:47,368 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:47,369 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:47,369 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:47,371 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:47,374 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:47,378 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:47,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:47,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:47,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:47,388 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:47,389 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:47,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:47,396 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:47,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:47,403 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:47,405 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:47,406 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:47,406 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:47,407 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:47,407 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:47,408 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:47,409 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:47,413 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:47,448 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:47,448 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:47,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:47,451 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:47,451 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:47,451 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:47,452 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:47,452 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:47,452 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:47,452 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:47,452 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:47,452 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:47,453 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:47,453 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:47,453 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:47,453 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:47,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:47,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:47,455 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:47,455 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:47,455 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:47,456 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:47,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:47,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:47,456 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:47,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:47,457 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:47,457 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:47,459 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:47,459 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 -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2018-11-28 23:19:47,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:47,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:47,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:47,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:47,548 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:47,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:47,617 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/421380045/d1c31e547848479f955f99f5aed25bf4/FLAG2a3ab13ca [2018-11-28 23:19:48,106 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:48,107 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:48,127 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/421380045/d1c31e547848479f955f99f5aed25bf4/FLAG2a3ab13ca [2018-11-28 23:19:48,418 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/421380045/d1c31e547848479f955f99f5aed25bf4 [2018-11-28 23:19:48,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:48,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:48,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:48,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:48,429 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:48,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:48" (1/1) ... [2018-11-28 23:19:48,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e0c10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:48, skipping insertion in model container [2018-11-28 23:19:48,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:48" (1/1) ... [2018-11-28 23:19:48,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:48,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:48,915 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:48,932 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:48,971 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:49,032 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:49,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49 WrapperNode [2018-11-28 23:19:49,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:49,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:49,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:49,034 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:49,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:49,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:49,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:49,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:49,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (1/1) ... [2018-11-28 23:19:49,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:49,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:49,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:49,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:49,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (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 [2018-11-28 23:19:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:49,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:49,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:49,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:49,753 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:49,754 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:19:49,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:49 BoogieIcfgContainer [2018-11-28 23:19:49,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:49,755 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:49,756 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:49,759 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:49,760 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:49,761 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:48" (1/3) ... [2018-11-28 23:19:49,764 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@471ce6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:49, skipping insertion in model container [2018-11-28 23:19:49,764 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:49,764 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:49" (2/3) ... [2018-11-28 23:19:49,764 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@471ce6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:49, skipping insertion in model container [2018-11-28 23:19:49,765 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:49,765 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:49" (3/3) ... [2018-11-28 23:19:49,767 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:49,832 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:49,832 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:49,832 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:49,833 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:49,833 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:49,833 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:49,833 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:49,833 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:49,833 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:49,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:49,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:49,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:49,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:49,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:49,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:49,878 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:49,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:49,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:49,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:49,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:49,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:49,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:49,888 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~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, 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.alloc(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.alloc(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.alloc(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.alloc(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); 14#L561-2true [2018-11-28 23:19:49,889 INFO L796 eck$LassoCheckResult]: Loop: 14#L561-2true 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; 12#L557-3true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;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 test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 4#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 14#L561-2true [2018-11-28 23:19:49,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:19:49,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:49,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:49,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:50,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2018-11-28 23:19:50,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:50,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:50,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:50,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:50,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:50,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:50,147 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2018-11-28 23:19:50,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:50,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:50,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:50,614 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2018-11-28 23:19:51,826 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2018-11-28 23:19:52,143 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-28 23:19:52,155 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:52,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:52,157 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:52,157 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:52,157 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:52,157 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:52,157 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:52,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:52,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-28 23:19:52,158 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:52,158 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:52,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:52,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,296 WARN L180 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-28 23:19:53,482 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2018-11-28 23:19:53,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:53,950 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-11-28 23:19:54,625 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:19:54,718 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:54,724 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:54,727 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 [2018-11-28 23:19:54,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,742 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 [2018-11-28 23:19:54,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:54,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:54,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:54,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,747 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 [2018-11-28 23:19:54,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:54,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:54,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:54,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,751 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 [2018-11-28 23:19:54,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:54,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:54,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:54,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,756 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 [2018-11-28 23:19:54,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:54,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:54,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:54,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,760 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 [2018-11-28 23:19:54,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:54,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:54,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:54,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,765 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 [2018-11-28 23:19:54,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,774 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 [2018-11-28 23:19:54,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:54,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:54,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:54,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,780 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 [2018-11-28 23:19:54,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:54,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:54,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:54,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,787 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 [2018-11-28 23:19:54,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,806 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 [2018-11-28 23:19:54,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,807 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:54,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,816 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:54,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,842 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 [2018-11-28 23:19:54,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,873 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 [2018-11-28 23:19:54,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,874 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:54,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,882 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:54,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,901 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 [2018-11-28 23:19:54,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,931 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 [2018-11-28 23:19:54,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,934 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,945 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 [2018-11-28 23:19:54,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,959 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 [2018-11-28 23:19:54,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,966 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 [2018-11-28 23:19:54,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,973 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 [2018-11-28 23:19:54,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,984 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 [2018-11-28 23:19:54,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:54,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:54,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:54,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:54,996 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 [2018-11-28 23:19:54,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:54,997 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:54,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:54,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:54,999 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:54,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:55,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:55,009 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 [2018-11-28 23:19:55,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:55,010 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:55,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:55,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:55,015 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:55,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:55,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:55,023 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 [2018-11-28 23:19:55,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:55,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:55,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:55,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:55,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:55,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:55,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:55,053 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 [2018-11-28 23:19:55,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:55,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:55,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:55,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:55,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:55,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:55,078 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:55,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:55,092 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:55,095 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:55,096 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:55,096 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:55,097 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 [] [2018-11-28 23:19:55,447 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-28 23:19:55,457 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:55,458 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:55,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:55,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:55,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:55,641 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 [2018-11-28 23:19:55,642 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2018-11-28 23:19:55,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2018-11-28 23:19:55,829 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 [2018-11-28 23:19:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:19:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-28 23:19:55,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:19:55,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:55,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:19:55,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:55,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-28 23:19:55,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:55,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-11-28 23:19:55,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-28 23:19:55,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 30 states and 45 transitions. [2018-11-28 23:19:55,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 23:19:55,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 23:19:55,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2018-11-28 23:19:55,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:55,848 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2018-11-28 23:19:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2018-11-28 23:19:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-28 23:19:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 23:19:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2018-11-28 23:19:55,876 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-28 23:19:55,876 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2018-11-28 23:19:55,876 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:55,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2018-11-28 23:19:55,877 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2018-11-28 23:19:55,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:55,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:55,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:55,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:55,878 INFO L794 eck$LassoCheckResult]: Stem: 289#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, 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.alloc(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.alloc(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.alloc(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.alloc(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); 283#L561-2 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; 302#L557-1 [2018-11-28 23:19:55,878 INFO L796 eck$LassoCheckResult]: Loop: 302#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; 299#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;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 test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 300#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 296#L561-2 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; 302#L557-1 [2018-11-28 23:19:55,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:55,879 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:19:55,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:55,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:55,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2018-11-28 23:19:55,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:55,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:55,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:55,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2018-11-28 23:19:55,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:55,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:55,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:56,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:56,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:19:56,891 WARN L180 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2018-11-28 23:19:57,389 WARN L180 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-11-28 23:19:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:19:57,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:19:57,395 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-28 23:19:57,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:57,461 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2018-11-28 23:19:57,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:19:57,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2018-11-28 23:19:57,466 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2018-11-28 23:19:57,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 51 transitions. [2018-11-28 23:19:57,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-28 23:19:57,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 23:19:57,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 51 transitions. [2018-11-28 23:19:57,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:57,468 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2018-11-28 23:19:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 51 transitions. [2018-11-28 23:19:57,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-11-28 23:19:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:19:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2018-11-28 23:19:57,472 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-11-28 23:19:57,473 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2018-11-28 23:19:57,475 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:57,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2018-11-28 23:19:57,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:19:57,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:57,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:57,476 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:57,476 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:57,477 INFO L794 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 369#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, 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.alloc(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.alloc(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.alloc(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.alloc(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); 370#L561-2 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; 377#L557-1 [2018-11-28 23:19:57,477 INFO L796 eck$LassoCheckResult]: Loop: 377#L557-1 assume test_fun_#t~short10; 378#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;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 test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 371#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 372#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 382#L561-2 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; 377#L557-1 [2018-11-28 23:19:57,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-28 23:19:57,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:57,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:57,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:57,526 INFO L82 PathProgramCache]: Analyzing trace with hash 38423577, now seen corresponding path program 1 times [2018-11-28 23:19:57,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:57,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:57,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:57,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 177751382, now seen corresponding path program 1 times [2018-11-28 23:19:57,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:57,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:57,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:57,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:57,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:19:58,029 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2018-11-28 23:19:58,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:19:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:19:58,099 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:19:58,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:58,137 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-11-28 23:19:58,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:19:58,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2018-11-28 23:19:58,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:19:58,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 20 transitions. [2018-11-28 23:19:58,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:19:58,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:19:58,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-28 23:19:58,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:58,141 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:19:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-28 23:19:58,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:19:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:19:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 23:19:58,145 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:19:58,145 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:19:58,145 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:19:58,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 23:19:58,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:19:58,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:58,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:58,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:19:58,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:58,149 INFO L794 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 418#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, 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.alloc(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.alloc(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.alloc(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.alloc(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); 419#L561-2 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; 425#L557-1 [2018-11-28 23:19:58,149 INFO L796 eck$LassoCheckResult]: Loop: 425#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; 426#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;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 test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 431#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 429#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 430#L561-2 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; 425#L557-1 [2018-11-28 23:19:58,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2018-11-28 23:19:58,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,188 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2018-11-28 23:19:58,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:58,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:58,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:58,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:19:58,258 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:58,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:19:58,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:19:58,258 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 23:19:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:58,300 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-11-28 23:19:58,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:19:58,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2018-11-28 23:19:58,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:58,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 23:19:58,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:19:58,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:19:58,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2018-11-28 23:19:58,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:58,305 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:19:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2018-11-28 23:19:58,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-28 23:19:58,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:19:58,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2018-11-28 23:19:58,308 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:19:58,308 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2018-11-28 23:19:58,308 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:19:58,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2018-11-28 23:19:58,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:58,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:58,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:58,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:58,311 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:58,311 INFO L794 eck$LassoCheckResult]: Stem: 465#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 459#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, 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.alloc(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.alloc(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.alloc(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.alloc(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); 460#L561-2 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; 466#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; 467#L557-3 [2018-11-28 23:19:58,312 INFO L796 eck$LassoCheckResult]: Loop: 467#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;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 test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 471#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 470#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 462#L561-2 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; 472#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; 467#L557-3 [2018-11-28 23:19:58,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,313 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 23:19:58,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:58,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,347 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2018-11-28 23:19:58,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:58,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:58,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2018-11-28 23:19:58,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:58,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:58,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:59,108 WARN L180 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-28 23:19:59,697 WARN L180 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-11-28 23:20:00,355 WARN L180 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 130 [2018-11-28 23:20:01,029 WARN L180 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-28 23:20:01,037 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:01,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:01,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:01,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:01,038 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:01,038 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:01,038 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:01,038 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:01,038 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-28 23:20:01,038 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:01,038 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:01,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:01,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:02,664 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2018-11-28 23:20:02,973 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-11-28 23:20:02,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:02,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:02,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,243 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-28 23:20:03,516 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-11-28 23:20:04,285 WARN L180 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-28 23:20:04,554 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 23:20:04,726 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:04,726 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:04,726 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 [2018-11-28 23:20:04,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:04,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:04,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,734 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 [2018-11-28 23:20:04,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:04,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:04,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:04,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:04,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,740 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 [2018-11-28 23:20:04,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:04,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:04,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,747 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 [2018-11-28 23:20:04,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:04,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:04,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,755 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 [2018-11-28 23:20:04,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:04,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:04,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,776 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 [2018-11-28 23:20:04,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,776 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:04,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,781 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:04,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,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 [2018-11-28 23:20:04,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,787 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:04,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,791 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:04,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,795 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 [2018-11-28 23:20:04,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,796 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:04,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,800 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:04,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,804 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 [2018-11-28 23:20:04,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:04,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:04,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,810 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 [2018-11-28 23:20:04,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:04,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:04,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,816 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 [2018-11-28 23:20:04,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,822 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:04,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:04,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:04,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:04,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:04,831 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 [2018-11-28 23:20:04,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:04,831 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:04,831 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:20:04,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:04,850 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:20:04,850 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:20:04,981 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:05,119 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:20:05,120 INFO L444 ModelExtractionUtils]: 81 out of 91 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-28 23:20:05,121 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:05,124 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:20:05,124 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:05,124 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)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2018-11-28 23:20:05,584 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-28 23:20:05,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:05,586 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:05,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:05,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:05,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:05,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:05,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 58 [2018-11-28 23:20:05,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-28 23:20:05,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,896 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:05,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-11-28 23:20:05,902 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:05,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:06,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:06,084 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-28 23:20:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:06,180 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 [2018-11-28 23:20:06,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-28 23:20:06,258 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 30 states and 35 transitions. Complement of second has 7 states. [2018-11-28 23:20:06,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:20:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:20:06,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2018-11-28 23:20:06,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2018-11-28 23:20:06,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2018-11-28 23:20:06,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2018-11-28 23:20:06,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:06,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2018-11-28 23:20:06,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:20:06,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:20:06,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-28 23:20:06,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:06,269 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-28 23:20:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-28 23:20:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2018-11-28 23:20:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:20:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-11-28 23:20:06,273 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-28 23:20:06,273 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-28 23:20:06,273 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:20:06,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2018-11-28 23:20:06,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:06,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:06,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:06,277 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:06,277 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:06,277 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, 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.alloc(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.alloc(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.alloc(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.alloc(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); 721#L561-2 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; 734#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; 737#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;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 test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 735#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 732#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 733#L561-2 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; 727#L557-1 assume test_fun_#t~short10; 728#L557-3 [2018-11-28 23:20:06,277 INFO L796 eck$LassoCheckResult]: Loop: 728#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~mem9;havoc test_fun_#t~mem7;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 test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 722#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem11;havoc test_fun_#t~mem12;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 723#L561-2 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; 741#L557-1 assume test_fun_#t~short10; 728#L557-3 [2018-11-28 23:20:06,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2018-11-28 23:20:06,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:06,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:06,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:06,611 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 23:20:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:06,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:06,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:20:06,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:06,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:06,810 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-28 23:20:06,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:06,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-28 23:20:06,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:06,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:06,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-11-28 23:20:06,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:06,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:06,911 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:06,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:06,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-28 23:20:06,915 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:06,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:06,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:06,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:06,952 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2018-11-28 23:20:07,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-11-28 23:20:07,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 23:20:07,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-11-28 23:20:07,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:07,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:07,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 23:20:07,187 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:20:07,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:07,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2018-11-28 23:20:07,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:07,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:07,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:07,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:07,336 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-28 23:20:07,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:20:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:20:07,368 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-28 23:20:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:07,526 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 23:20:07,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:20:07,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 23:20:07,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:07,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2018-11-28 23:20:07,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:07,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:07,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:07,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:07,529 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:07,529 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:07,529 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:07,529 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:20:07,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:07,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:07,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:07,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:07 BoogieIcfgContainer [2018-11-28 23:20:07,537 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:07,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:07,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:07,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:07,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:49" (3/4) ... [2018-11-28 23:20:07,542 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:07,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:07,543 INFO L168 Benchmark]: Toolchain (without parser) took 19120.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.9 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -386.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:07,544 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. [2018-11-28 23:20:07,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:07,545 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:07,546 INFO L168 Benchmark]: Boogie Preprocessor took 31.41 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. [2018-11-28 23:20:07,547 INFO L168 Benchmark]: RCFGBuilder took 523.85 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.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:07,548 INFO L168 Benchmark]: BuchiAutomizer took 17781.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -263.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:07,549 INFO L168 Benchmark]: Witness Printer took 4.86 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:07,553 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 608.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 165.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.41 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 523.85 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.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17781.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -263.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.86 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 6 terminating modules (4 trivial, 2 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. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 16.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 39 SDtfs, 64 SDslu, 37 SDs, 0 SdLazy, 138 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital630 mio100 ax103 hnf99 lsp73 ukn72 mio100 lsp30 div100 bol104 ite100 ukn100 eq182 hnf88 smp96 dnf231 smp73 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 293ms VariablesStem: 17 VariablesLoop: 12 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...