./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/b.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-0ed9222-m [2019-01-14 02:30:54,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:30:54,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:30:54,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:30:54,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:30:54,290 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:30:54,292 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:30:54,294 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:30:54,297 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:30:54,299 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:30:54,302 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:30:54,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:30:54,304 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:30:54,307 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:30:54,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:30:54,318 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:30:54,319 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:30:54,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:30:54,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:30:54,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:30:54,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:30:54,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:30:54,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:30:54,343 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:30:54,343 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:30:54,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:30:54,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:30:54,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:30:54,351 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:30:54,354 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:30:54,356 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:30:54,357 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:30:54,357 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:30:54,357 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:30:54,358 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:30:54,359 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:30:54,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:30:54,391 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:30:54,392 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:30:54,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:30:54,396 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:30:54,397 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:30:54,397 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:30:54,398 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:30:54,399 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:30:54,399 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:30:54,399 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:30:54,399 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:30:54,399 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:30:54,399 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:30:54,400 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:30:54,400 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:30:54,401 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:30:54,401 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:30:54,401 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:30:54,401 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:30:54,401 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:30:54,401 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:30:54,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:30:54,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:30:54,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:30:54,405 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:30:54,405 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:30:54,405 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:30:54,406 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:30:54,408 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:30:54,408 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 [2019-01-14 02:30:54,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:30:54,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:30:54,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:30:54,478 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:30:54,478 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:30:54,478 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 [2019-01-14 02:30:54,537 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbeb670d6/9ff6b1e614e34ce68d418bab9fe3a8a1/FLAG93ed3f106 [2019-01-14 02:30:55,021 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:30:55,023 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:55,041 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbeb670d6/9ff6b1e614e34ce68d418bab9fe3a8a1/FLAG93ed3f106 [2019-01-14 02:30:55,342 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbeb670d6/9ff6b1e614e34ce68d418bab9fe3a8a1 [2019-01-14 02:30:55,346 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:30:55,347 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:30:55,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:55,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:30:55,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:30:55,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:55,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca20744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55, skipping insertion in model container [2019-01-14 02:30:55,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:55,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:30:55,413 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:30:55,748 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:55,772 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:30:55,903 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:30:55,956 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:30:55,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55 WrapperNode [2019-01-14 02:30:55,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:30:55,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:55,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:30:55,958 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:30:55,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:55,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:56,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:30:56,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:30:56,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:30:56,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:30:56,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:56,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:56,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:56,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:56,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:56,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:56,044 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... [2019-01-14 02:30:56,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:30:56,048 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:30:56,048 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:30:56,048 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:30:56,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:30:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:30:56,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:30:56,518 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:30:56,518 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:30:56,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:56 BoogieIcfgContainer [2019-01-14 02:30:56,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:30:56,521 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:30:56,521 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:30:56,525 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:30:56,526 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:56,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:30:55" (1/3) ... [2019-01-14 02:30:56,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51f62444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:56, skipping insertion in model container [2019-01-14 02:30:56,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:56,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:30:55" (2/3) ... [2019-01-14 02:30:56,528 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@51f62444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:30:56, skipping insertion in model container [2019-01-14 02:30:56,528 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:30:56,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:56" (3/3) ... [2019-01-14 02:30:56,530 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.13-alloca_true-termination_true-no-overflow.c.i [2019-01-14 02:30:56,584 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:30:56,584 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:30:56,585 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:30:56,585 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:30:56,585 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:30:56,585 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:30:56,585 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:30:56,585 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:30:56,586 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:30:56,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:30:56,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:56,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:56,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:56,627 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:56,627 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:56,627 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:30:56,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:30:56,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:30:56,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:30:56,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:30:56,630 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:30:56,630 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:30:56,638 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.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 14#L561-2true [2019-01-14 02:30:56,638 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~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;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 [2019-01-14 02:30:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:30:56,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:56,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:56,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:56,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:56,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:56,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:56,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1142247, now seen corresponding path program 1 times [2019-01-14 02:30:56,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:56,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:56,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:56,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:56,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:30:56,884 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-01-14 02:30:56,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:30:56,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:30:56,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:56,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:30:56,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:30:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:30:57,361 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-01-14 02:30:58,665 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2019-01-14 02:30:59,019 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-01-14 02:30:59,032 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:30:59,033 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:30:59,034 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:30:59,034 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:30:59,034 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:30:59,034 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:30:59,034 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:30:59,035 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:30:59,035 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2019-01-14 02:30:59,035 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:30:59,035 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:30:59,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:30:59,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:00,132 WARN L181 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 98 [2019-01-14 02:31:00,327 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-14 02:31:00,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:00,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:00,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:00,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:00,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:00,648 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-14 02:31:02,461 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:31:02,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:02,642 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:02,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,699 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,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 [2019-01-14 02:31:02,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:31:02,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:31:02,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:31:02,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,798 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,798 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,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 [2019-01-14 02:31:02,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,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 [2019-01-14 02:31:02,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,835 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:02,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:02,912 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:02,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:02,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:02,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:02,938 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-14 02:31:02,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:02,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:02,948 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-14 02:31:02,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:03,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:03,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:03,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:03,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:03,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:03,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:03,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:03,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:03,054 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:03,072 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:31:03,072 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:31:03,076 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:03,079 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:31:03,080 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:03,083 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-01-14 02:31:03,560 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-01-14 02:31:03,569 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:03,570 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:03,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:03,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:03,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:03,871 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-14 02:31:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:03,903 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:31:03,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 4 states. [2019-01-14 02:31:04,095 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. [2019-01-14 02:31:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:31:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:31:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2019-01-14 02:31:04,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:31:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:04,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:31:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:04,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-14 02:31:04,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:04,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-01-14 02:31:04,109 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-01-14 02:31:04,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 30 states and 45 transitions. [2019-01-14 02:31:04,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:31:04,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:31:04,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 45 transitions. [2019-01-14 02:31:04,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:04,116 INFO L706 BuchiCegarLoop]: Abstraction has 30 states and 45 transitions. [2019-01-14 02:31:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 45 transitions. [2019-01-14 02:31:04,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-14 02:31:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 02:31:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-01-14 02:31:04,141 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-01-14 02:31:04,141 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-01-14 02:31:04,141 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:31:04,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2019-01-14 02:31:04,143 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-01-14 02:31:04,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:04,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:04,143 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:31:04,143 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:31:04,144 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.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 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 [2019-01-14 02:31:04,144 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~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;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 [2019-01-14 02:31:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:31:04,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:04,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:04,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1298969, now seen corresponding path program 1 times [2019-01-14 02:31:04,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:04,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:04,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:04,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:04,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908732, now seen corresponding path program 1 times [2019-01-14 02:31:04,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:04,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:04,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:04,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:04,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:04,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:04,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:31:05,129 WARN L181 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2019-01-14 02:31:05,394 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-14 02:31:05,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:31:05,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:31:05,400 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-01-14 02:31:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:05,465 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2019-01-14 02:31:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:31:05,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 65 transitions. [2019-01-14 02:31:05,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2019-01-14 02:31:05,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 51 transitions. [2019-01-14 02:31:05,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 02:31:05,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 02:31:05,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 51 transitions. [2019-01-14 02:31:05,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:05,472 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2019-01-14 02:31:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 51 transitions. [2019-01-14 02:31:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2019-01-14 02:31:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 02:31:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-01-14 02:31:05,475 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-01-14 02:31:05,475 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-01-14 02:31:05,475 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:31:05,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2019-01-14 02:31:05,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:31:05,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:05,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:05,477 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:31:05,477 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:31:05,478 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.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 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 [2019-01-14 02:31:05,478 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~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;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 [2019-01-14 02:31:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-14 02:31:05,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:05,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:05,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:05,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:05,526 INFO L82 PathProgramCache]: Analyzing trace with hash 38423577, now seen corresponding path program 1 times [2019-01-14 02:31:05,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:05,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:05,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:05,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:05,543 INFO L82 PathProgramCache]: Analyzing trace with hash 177751382, now seen corresponding path program 1 times [2019-01-14 02:31:05,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:05,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:05,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:05,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:05,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:05,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:31:05,795 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-01-14 02:31:05,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:31:05,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:31:05,834 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-01-14 02:31:05,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:05,874 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-14 02:31:05,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:31:05,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. [2019-01-14 02:31:05,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:31:05,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 20 transitions. [2019-01-14 02:31:05,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:31:05,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:31:05,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-01-14 02:31:05,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:05,878 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:31:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-01-14 02:31:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 02:31:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:31:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-01-14 02:31:05,880 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:31:05,880 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-01-14 02:31:05,880 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:31:05,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-01-14 02:31:05,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:31:05,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:05,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:05,881 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:31:05,882 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:31:05,882 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.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 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 [2019-01-14 02:31:05,882 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~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;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 [2019-01-14 02:31:05,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:05,882 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2019-01-14 02:31:05,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:05,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:05,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:05,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash 40270619, now seen corresponding path program 1 times [2019-01-14 02:31:05,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:05,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:31:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:05,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:31:05,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:31:05,996 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:31:05,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:31:05,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:31:05,997 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2019-01-14 02:31:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:06,061 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2019-01-14 02:31:06,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:31:06,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2019-01-14 02:31:06,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:06,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 18 transitions. [2019-01-14 02:31:06,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:31:06,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:31:06,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 18 transitions. [2019-01-14 02:31:06,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:06,065 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:31:06,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 18 transitions. [2019-01-14 02:31:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-14 02:31:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:31:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-14 02:31:06,067 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:31:06,067 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:31:06,068 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:31:06,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-14 02:31:06,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:06,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:06,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:06,069 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:31:06,069 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:31:06,069 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.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 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 [2019-01-14 02:31:06,069 INFO L796 eck$LassoCheckResult]: Loop: 467#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;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 [2019-01-14 02:31:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,069 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2019-01-14 02:31:06,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:06,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash 45962937, now seen corresponding path program 1 times [2019-01-14 02:31:06,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:06,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:06,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581938, now seen corresponding path program 1 times [2019-01-14 02:31:06,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:06,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:06,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:06,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:06,454 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-01-14 02:31:06,760 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-01-14 02:31:07,591 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 135 [2019-01-14 02:31:08,551 WARN L181 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-01-14 02:31:08,556 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:31:08,556 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:31:08,556 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:31:08,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:31:08,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:31:08,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:31:08,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:31:08,557 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:31:08,557 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2019-01-14 02:31:08,557 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:31:08,558 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:31:08,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:08,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,195 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 131 DAG size of output: 115 [2019-01-14 02:31:10,549 WARN L181 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-01-14 02:31:10,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:31:10,774 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-01-14 02:31:10,990 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-01-14 02:31:11,971 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-01-14 02:31:12,198 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-01-14 02:31:13,301 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:31:13,407 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:31:13,407 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:31:13,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:13,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:13,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:13,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:13,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:13,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:13,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:13,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:13,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:13,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:13,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:13,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:13,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:13,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:13,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:13,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:13,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:13,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:13,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:13,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:13,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:13,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:13,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:13,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:13,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:13,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:13,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:13,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:13,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:13,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:13,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:13,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:13,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:13,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:13,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:13,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:13,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:13,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:13,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:13,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:13,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:13,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:13,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:31:13,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:31:13,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:13,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:31:13,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:31:13,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:31:13,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:31:13,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:31:13,463 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:31:13,465 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:31:13,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:31:13,478 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-01-14 02:31:13,478 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:31:13,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:31:13,685 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:31:13,685 INFO L444 ModelExtractionUtils]: 87 out of 91 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:31:13,687 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:31:13,690 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:31:13,692 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:31:13,692 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 [] [2019-01-14 02:31:14,814 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-01-14 02:31:14,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:14,829 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:31:15,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:15,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:15,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:15,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:15,463 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-14 02:31:15,533 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 [2019-01-14 02:31:15,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:15,578 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 [2019-01-14 02:31:15,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:15,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:15,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:15,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:15,929 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 [2019-01-14 02:31:15,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:15,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:15,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:31:15,980 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2019-01-14 02:31:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:16,014 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:31:16,015 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-01-14 02:31:16,080 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. [2019-01-14 02:31:16,081 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 [2019-01-14 02:31:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:31:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-14 02:31:16,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 5 letters. [2019-01-14 02:31:16,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:16,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 5 letters. [2019-01-14 02:31:16,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:16,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 10 letters. [2019-01-14 02:31:16,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:31:16,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 35 transitions. [2019-01-14 02:31:16,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:16,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 24 states and 28 transitions. [2019-01-14 02:31:16,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:31:16,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 02:31:16,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2019-01-14 02:31:16,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:31:16,090 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2019-01-14 02:31:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2019-01-14 02:31:16,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-14 02:31:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:31:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-01-14 02:31:16,094 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-14 02:31:16,094 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-14 02:31:16,094 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:31:16,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2019-01-14 02:31:16,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:31:16,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:31:16,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:31:16,097 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:31:16,097 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:31:16,097 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.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 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~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;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 [2019-01-14 02:31:16,098 INFO L796 eck$LassoCheckResult]: Loop: 728#L557-3 assume !!test_fun_#t~short10;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem9;havoc test_fun_#t~short10;havoc test_fun_#t~mem7;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 [2019-01-14 02:31:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:16,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1272581936, now seen corresponding path program 1 times [2019-01-14 02:31:16,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:16,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:16,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:16,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:16,407 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:31:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:16,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:31:16,438 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 [2019-01-14 02:31:16,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:31:16,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:31:16,602 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 02:31:16,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,642 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 [2019-01-14 02:31:16,865 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-14 02:31:16,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,887 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 [2019-01-14 02:31:16,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:16,922 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 [2019-01-14 02:31:16,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:16,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:16,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:16,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:16,988 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2019-01-14 02:31:17,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,201 INFO L303 Elim1Store]: Index analysis took 128 ms [2019-01-14 02:31:17,203 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 [2019-01-14 02:31:17,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:31:17,210 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 [2019-01-14 02:31:17,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:31:17,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2019-01-14 02:31:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:31:17,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:31:17,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-14 02:31:17,296 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:31:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:31:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1480167, now seen corresponding path program 2 times [2019-01-14 02:31:17,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:31:17,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:31:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:17,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:31:17,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:31:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:31:17,460 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-01-14 02:31:17,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:31:17,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:31:17,492 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-01-14 02:31:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:31:17,622 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2019-01-14 02:31:17,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:31:17,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2019-01-14 02:31:17,625 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:31:17,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2019-01-14 02:31:17,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:31:17,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:31:17,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:31:17,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:31:17,626 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:17,627 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:17,627 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:31:17,627 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:31:17,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:31:17,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:31:17,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:31:17,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:31:17 BoogieIcfgContainer [2019-01-14 02:31:17,633 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:31:17,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:31:17,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:31:17,634 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:31:17,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:30:56" (3/4) ... [2019-01-14 02:31:17,638 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:31:17,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:31:17,639 INFO L168 Benchmark]: Toolchain (without parser) took 22292.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.7 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -369.2 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:17,640 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:17,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:17,641 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:17,642 INFO L168 Benchmark]: Boogie Preprocessor took 40.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:31:17,642 INFO L168 Benchmark]: RCFGBuilder took 472.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:17,643 INFO L168 Benchmark]: BuchiAutomizer took 21112.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -213.7 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:31:17,645 INFO L168 Benchmark]: Witness Printer took 4.36 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. [2019-01-14 02:31:17,650 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.12 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.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 472.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21112.44 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 219.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -213.7 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.36 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 21.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 18.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.8s. 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.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital648 mio100 ax103 hnf99 lsp73 ukn74 mio100 lsp28 div100 bol104 ite100 ukn100 eq182 hnf88 smp96 dnf621 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 95ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...