./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer --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 32bit --witnessprinter.graph.data.programhash f42aa215a16d5e0efb670a585ba0238849a32fc4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 17:31:33,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 17:31:33,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 17:31:33,342 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 17:31:33,343 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 17:31:33,343 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 17:31:33,344 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 17:31:33,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 17:31:33,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 17:31:33,346 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 17:31:33,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 17:31:33,347 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 17:31:33,348 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 17:31:33,348 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 17:31:33,349 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 17:31:33,350 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 17:31:33,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 17:31:33,351 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 17:31:33,352 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 17:31:33,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 17:31:33,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 17:31:33,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 17:31:33,355 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 17:31:33,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 17:31:33,355 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 17:31:33,355 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 17:31:33,356 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 17:31:33,356 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 17:31:33,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 17:31:33,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 17:31:33,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 17:31:33,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 17:31:33,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 17:31:33,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 17:31:33,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 17:31:33,359 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 17:31:33,360 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 17:31:33,368 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 17:31:33,369 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 17:31:33,369 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 17:31:33,370 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 17:31:33,370 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 17:31:33,370 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 17:31:33,370 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 17:31:33,370 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 17:31:33,371 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 17:31:33,371 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 17:31:33,371 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 17:31:33,371 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 17:31:33,371 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 17:31:33,371 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 17:31:33,371 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 17:31:33,372 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 17:31:33,372 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 17:31:33,372 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 17:31:33,372 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 17:31:33,372 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 17:31:33,372 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 17:31:33,373 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 17:31:33,373 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 17:31:33,373 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 17:31:33,373 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 17:31:33,373 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 17:31:33,373 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 17:31:33,373 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 17:31:33,374 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 17:31:33,374 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 17:31:33,374 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 17:31:33,375 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 17:31:33,375 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f42aa215a16d5e0efb670a585ba0238849a32fc4 [2018-12-01 17:31:33,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 17:31:33,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 17:31:33,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 17:31:33,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 17:31:33,407 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 17:31:33,407 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:31:33,445 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/data/a7d63a6e1/33e35912f3684427a904c474e8ea12e7/FLAGe47e37e63 [2018-12-01 17:31:33,920 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 17:31:33,920 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/sv-benchmarks/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:31:33,926 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/data/a7d63a6e1/33e35912f3684427a904c474e8ea12e7/FLAGe47e37e63 [2018-12-01 17:31:34,425 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/data/a7d63a6e1/33e35912f3684427a904c474e8ea12e7 [2018-12-01 17:31:34,426 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 17:31:34,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 17:31:34,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 17:31:34,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 17:31:34,430 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 17:31:34,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495e205e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34, skipping insertion in model container [2018-12-01 17:31:34,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 17:31:34,454 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 17:31:34,592 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:31:34,599 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 17:31:34,663 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 17:31:34,682 INFO L195 MainTranslator]: Completed translation [2018-12-01 17:31:34,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34 WrapperNode [2018-12-01 17:31:34,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 17:31:34,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 17:31:34,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 17:31:34,683 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 17:31:34,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 17:31:34,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 17:31:34,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 17:31:34,707 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 17:31:34,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... [2018-12-01 17:31:34,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 17:31:34,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 17:31:34,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 17:31:34,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 17:31:34,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3e81e5d-b2e4-4110-81fb-013ab306c389/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:31:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 17:31:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 17:31:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 17:31:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 17:31:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 17:31:34,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 17:31:34,876 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 17:31:34,876 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-12-01 17:31:34,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:31:34 BoogieIcfgContainer [2018-12-01 17:31:34,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 17:31:34,876 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 17:31:34,876 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 17:31:34,880 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 17:31:34,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:31:34,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 05:31:34" (1/3) ... [2018-12-01 17:31:34,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7050a0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 05:31:34, skipping insertion in model container [2018-12-01 17:31:34,882 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:31:34,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 05:31:34" (2/3) ... [2018-12-01 17:31:34,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7050a0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 05:31:34, skipping insertion in model container [2018-12-01 17:31:34,882 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 17:31:34,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:31:34" (3/3) ... [2018-12-01 17:31:34,884 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-12-01 17:31:34,925 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 17:31:34,926 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 17:31:34,926 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 17:31:34,926 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 17:31:34,926 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 17:31:34,926 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 17:31:34,926 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 17:31:34,926 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 17:31:34,926 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 17:31:34,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-01 17:31:34,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 17:31:34,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:31:34,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:31:34,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 17:31:34,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:31:34,955 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 17:31:34,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-01 17:31:34,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 17:31:34,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:31:34,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:31:34,957 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 17:31:34,957 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 17:31:34,964 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L558-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 11#L545-3true [2018-12-01 17:31:34,965 INFO L796 eck$LassoCheckResult]: Loop: 11#L545-3true assume !!(test_fun_~i~0 < test_fun_~N); 8#L546-3true assume !true; 3#L550-2true assume !true; 9#L545-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L545-3true [2018-12-01 17:31:34,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-01 17:31:34,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:34,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:35,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:35,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2018-12-01 17:31:35,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:35,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:35,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:35,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:35,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 17:31:35,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 17:31:35,061 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 17:31:35,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-01 17:31:35,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-01 17:31:35,071 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-01 17:31:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 17:31:35,075 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-01 17:31:35,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-01 17:31:35,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-01 17:31:35,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 17:31:35,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-12-01 17:31:35,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 17:31:35,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 17:31:35,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-12-01 17:31:35,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:31:35,080 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 17:31:35,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-12-01 17:31:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-01 17:31:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 17:31:35,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-01 17:31:35,097 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 17:31:35,097 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-01 17:31:35,097 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 17:31:35,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-01 17:31:35,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-12-01 17:31:35,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:31:35,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:31:35,098 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-01 17:31:35,098 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-01 17:31:35,098 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 37#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 41#L545-3 [2018-12-01 17:31:35,098 INFO L796 eck$LassoCheckResult]: Loop: 41#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 42#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 38#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 41#L545-3 [2018-12-01 17:31:35,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:35,098 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-12-01 17:31:35,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:35,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:35,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:35,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2018-12-01 17:31:35,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:35,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:35,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:31:35,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2018-12-01 17:31:35,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:35,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:35,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,273 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:31:35,274 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:31:35,274 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:31:35,274 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:31:35,274 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:31:35,274 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:31:35,275 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:31:35,275 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:31:35,275 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-12-01 17:31:35,275 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:31:35,275 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:31:35,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,568 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:31:35,571 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:31:35,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,575 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:35,584 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:35,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:35,592 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:35,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:35,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:35,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:35,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:35,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:35,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:35,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:35,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:35,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:35,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:35,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:35,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:35,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:35,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:35,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:35,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:35,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:35,651 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:31:35,671 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:31:35,671 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 17:31:35,673 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:31:35,674 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:31:35,674 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:31:35,674 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-12-01 17:31:35,682 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 17:31:35,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:35,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:35,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:35,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:35,737 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-12-01 17:31:35,764 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 23 transitions. Complement of second has 4 states. [2018-12-01 17:31:35,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-12-01 17:31:35,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-12-01 17:31:35,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:35,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-12-01 17:31:35,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:35,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-12-01 17:31:35,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:35,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-12-01 17:31:35,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 17:31:35,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2018-12-01 17:31:35,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 17:31:35,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 17:31:35,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-12-01 17:31:35,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:31:35,769 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-12-01 17:31:35,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-12-01 17:31:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-12-01 17:31:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-01 17:31:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-12-01 17:31:35,770 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-01 17:31:35,770 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-12-01 17:31:35,770 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 17:31:35,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-12-01 17:31:35,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 17:31:35,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:31:35,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:31:35,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-01 17:31:35,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 17:31:35,771 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 126#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 131#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 132#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 133#L546-3 [2018-12-01 17:31:35,771 INFO L796 eck$LassoCheckResult]: Loop: 133#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 137#L546-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 133#L546-3 [2018-12-01 17:31:35,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:35,771 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-12-01 17:31:35,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:35,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:35,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:35,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:35,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-12-01 17:31:35,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:35,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:35,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:35,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-12-01 17:31:35,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:35,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:35,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:35,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:35,943 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:31:35,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:31:35,943 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:31:35,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:31:35,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:31:35,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:31:35,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:31:35,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:31:35,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-12-01 17:31:35,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:31:35,944 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:31:35,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:35,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,184 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:31:36,184 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:31:36,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,241 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 17:31:36,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,242 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 17:31:36,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,248 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:31:36,248 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 17:31:36,248 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 17:31:36,249 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:31:36,249 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 17:31:36,249 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:31:36,249 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-12-01 17:31:36,253 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-01 17:31:36,254 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:31:36,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:36,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:36,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:36,285 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:36,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-01 17:31:36,303 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2018-12-01 17:31:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-01 17:31:36,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-01 17:31:36,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:36,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 17:31:36,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:36,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-01 17:31:36,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:36,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-12-01 17:31:36,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 17:31:36,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2018-12-01 17:31:36,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-12-01 17:31:36,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 17:31:36,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2018-12-01 17:31:36,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:31:36,306 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-01 17:31:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2018-12-01 17:31:36,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-12-01 17:31:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-01 17:31:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-12-01 17:31:36,307 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-01 17:31:36,308 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-12-01 17:31:36,308 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 17:31:36,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-12-01 17:31:36,308 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 17:31:36,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:31:36,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:31:36,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:31:36,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 17:31:36,308 INFO L794 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 234#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 241#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 235#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 236#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 243#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 229#L550-2 [2018-12-01 17:31:36,309 INFO L796 eck$LassoCheckResult]: Loop: 229#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 230#L550 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 229#L550-2 [2018-12-01 17:31:36,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:36,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-12-01 17:31:36,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:36,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:36,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:36,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2018-12-01 17:31:36,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:36,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2018-12-01 17:31:36,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:36,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:36,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:36,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,460 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:31:36,460 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:31:36,461 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:31:36,461 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:31:36,461 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:31:36,461 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:31:36,461 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:31:36,461 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:31:36,461 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-12-01 17:31:36,461 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:31:36,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:31:36,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,737 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:31:36,737 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:31:36,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:36,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:36,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:36,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:36,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:36,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:36,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:36,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:36,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:36,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:36,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:36,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:31:36,761 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 17:31:36,761 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 17:31:36,762 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:31:36,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:31:36,763 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:31:36,763 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-12-01 17:31:36,768 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-01 17:31:36,769 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:31:36,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:36,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:36,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:36,801 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:36,801 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-01 17:31:36,814 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2018-12-01 17:31:36,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-01 17:31:36,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-01 17:31:36,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:36,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-01 17:31:36,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:36,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-01 17:31:36,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:36,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-12-01 17:31:36,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 17:31:36,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2018-12-01 17:31:36,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-01 17:31:36,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-01 17:31:36,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-12-01 17:31:36,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:31:36,817 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-12-01 17:31:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-12-01 17:31:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-01 17:31:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-01 17:31:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-12-01 17:31:36,819 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-12-01 17:31:36,819 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-12-01 17:31:36,819 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 17:31:36,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-12-01 17:31:36,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 17:31:36,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:31:36,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:31:36,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:31:36,820 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 17:31:36,820 INFO L794 eck$LassoCheckResult]: Stem: 361#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 354#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 360#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 355#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 356#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 369#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 365#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 368#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 366#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 357#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 359#L546-3 [2018-12-01 17:31:36,820 INFO L796 eck$LassoCheckResult]: Loop: 359#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 362#L546-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 359#L546-3 [2018-12-01 17:31:36,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:36,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2018-12-01 17:31:36,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:36,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:36,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:36,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:36,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-12-01 17:31:36,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:36,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:31:36,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2018-12-01 17:31:36,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:36,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:31:36,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:36,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:36,989 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:31:36,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:31:36,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:31:36,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:31:36,990 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:31:36,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:31:36,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:31:36,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:31:36,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-12-01 17:31:36,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:31:36,990 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:31:36,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:36,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,208 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:31:37,208 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:31:37,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:37,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:37,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:37,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:37,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,217 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:37,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:37,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,221 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:37,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:37,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:37,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:37,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,227 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:31:37,227 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 17:31:37,227 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 17:31:37,228 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:31:37,228 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-01 17:31:37,228 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:31:37,228 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2018-12-01 17:31:37,233 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-12-01 17:31:37,234 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:31:37,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:37,259 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:37,259 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-01 17:31:37,279 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-12-01 17:31:37,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-01 17:31:37,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-01 17:31:37,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,280 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:31:37,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:37,310 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:37,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-01 17:31:37,323 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-12-01 17:31:37,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-12-01 17:31:37,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-01 17:31:37,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,324 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:31:37,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:37,354 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:37,355 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-01 17:31:37,370 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 53 transitions. Complement of second has 6 states. [2018-12-01 17:31:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:37,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-12-01 17:31:37,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2018-12-01 17:31:37,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-01 17:31:37,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-12-01 17:31:37,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2018-12-01 17:31:37,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 17:31:37,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2018-12-01 17:31:37,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 17:31:37,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-01 17:31:37,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2018-12-01 17:31:37,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 17:31:37,375 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-12-01 17:31:37,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2018-12-01 17:31:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-12-01 17:31:37,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-01 17:31:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-12-01 17:31:37,377 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-01 17:31:37,377 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-12-01 17:31:37,377 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 17:31:37,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-12-01 17:31:37,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 17:31:37,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 17:31:37,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 17:31:37,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 17:31:37,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 17:31:37,378 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 653#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 654#L558-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 655#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 656#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 666#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 664#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 668#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 657#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 659#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 648#L550-2 [2018-12-01 17:31:37,378 INFO L796 eck$LassoCheckResult]: Loop: 648#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 649#L550 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 648#L550-2 [2018-12-01 17:31:37,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,378 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2018-12-01 17:31:37,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:37,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:37,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:37,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 17:31:37,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:37,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2018-12-01 17:31:37,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:37,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:37,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:37,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:31:37,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:37,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2018-12-01 17:31:37,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 17:31:37,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 17:31:37,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:37,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 17:31:37,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 17:31:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 17:31:37,532 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-12-01 17:31:37,566 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 17:31:37,566 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 17:31:37,566 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 17:31:37,566 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 17:31:37,566 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 17:31:37,566 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 17:31:37,567 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 17:31:37,567 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 17:31:37,567 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-12-01 17:31:37,567 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 17:31:37,567 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 17:31:37,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 17:31:37,826 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 17:31:37,826 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 17:31:37,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 [2018-12-01 17:31:37,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:37,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:37,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 17:31:37,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 17:31:37,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 17:31:37,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:37,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:37,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 17:31:37,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 17:31:37,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 17:31:37,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 17:31:37,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 17:31:37,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 17:31:37,841 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 17:31:37,841 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 17:31:37,847 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 17:31:37,852 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 17:31:37,852 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 17:31:37,852 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 17:31:37,853 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 17:31:37,853 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 17:31:37,853 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_3 Supporting invariants [] [2018-12-01 17:31:37,861 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-01 17:31:37,861 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-01 17:31:37,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:37,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:37,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-01 17:31:37,897 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-12-01 17:31:37,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-01 17:31:37,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-01 17:31:37,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,898 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:31:37,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:37,920 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:37,920 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-01 17:31:37,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-12-01 17:31:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-01 17:31:37,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-01 17:31:37,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,928 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-01 17:31:37,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 17:31:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 17:31:37,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 17:31:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 17:31:37,957 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 17:31:37,957 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-12-01 17:31:37,967 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 6 states. [2018-12-01 17:31:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 17:31:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 17:31:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-12-01 17:31:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2018-12-01 17:31:37,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2018-12-01 17:31:37,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2018-12-01 17:31:37,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 17:31:37,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-12-01 17:31:37,969 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 17:31:37,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-12-01 17:31:37,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 17:31:37,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 17:31:37,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 17:31:37,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 17:31:37,970 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:31:37,970 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:31:37,970 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 17:31:37,970 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 17:31:37,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 17:31:37,970 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 17:31:37,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 17:31:37,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 05:31:37 BoogieIcfgContainer [2018-12-01 17:31:37,975 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 17:31:37,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 17:31:37,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 17:31:37,976 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 17:31:37,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 05:31:34" (3/4) ... [2018-12-01 17:31:37,978 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 17:31:37,978 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 17:31:37,979 INFO L168 Benchmark]: Toolchain (without parser) took 3551.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -220.6 MB). Peak memory consumption was 79.3 MB. Max. memory is 11.5 GB. [2018-12-01 17:31:37,979 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:31:37,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-12-01 17:31:37,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.19 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-01 17:31:37,980 INFO L168 Benchmark]: Boogie Preprocessor took 14.30 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. [2018-12-01 17:31:37,981 INFO L168 Benchmark]: RCFGBuilder took 154.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-01 17:31:37,981 INFO L168 Benchmark]: BuchiAutomizer took 3098.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.7 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. [2018-12-01 17:31:37,981 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 17:31:37,984 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.19 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.30 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 154.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3098.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -86.7 MB). Peak memory consumption was 91.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 85 SDslu, 9 SDs, 0 SdLazy, 108 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf99 lsp89 ukn78 mio100 lsp55 div100 bol100 ite100 ukn100 eq175 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...