./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/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 64bit --witnessprinter.graph.data.programhash 10c50c605d9fb7cd886e3d668ba568a2b619230b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:36:53,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:36:53,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:36:53,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:36:53,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:36:53,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:36:53,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:36:53,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:36:53,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:36:53,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:36:53,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:36:53,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:36:53,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:36:53,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:36:53,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:36:53,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:36:53,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:36:53,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:36:53,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:36:53,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:36:53,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:36:53,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:36:53,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:36:53,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:36:53,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:36:53,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:36:53,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:36:53,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:36:53,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:36:53,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:36:53,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:36:53,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:36:53,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:36:53,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:36:53,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:36:53,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:36:53,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:36:53,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:36:53,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:36:53,386 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:36:53,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:36:53,388 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:36:53,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:36:53,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:36:53,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:36:53,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:36:53,411 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:36:53,412 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:36:53,412 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:36:53,412 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:36:53,412 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:36:53,412 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:36:53,413 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:36:53,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:36:53,414 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:36:53,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:36:53,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:36:53,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:36:53,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:36:53,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:36:53,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:36:53,415 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:36:53,416 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:36:53,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:36:53,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:36:53,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:36:53,417 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:36:53,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:36:53,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:36:53,417 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:36:53,420 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:36:53,420 INFO L138 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/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10c50c605d9fb7cd886e3d668ba568a2b619230b [2019-11-16 00:36:53,476 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:36:53,486 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:36:53,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:36:53,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:36:53,491 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:36:53,492 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2019-11-16 00:36:53,544 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/data/3d6d3fa51/04b53bea996e4745bb6effd92e9aaaa7/FLAG2f19ed64b [2019-11-16 00:36:54,046 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:36:54,047 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2019-11-16 00:36:54,064 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/data/3d6d3fa51/04b53bea996e4745bb6effd92e9aaaa7/FLAG2f19ed64b [2019-11-16 00:36:54,562 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/uautomizer/data/3d6d3fa51/04b53bea996e4745bb6effd92e9aaaa7 [2019-11-16 00:36:54,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:36:54,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:36:54,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:36:54,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:36:54,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:36:54,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:36:54" (1/1) ... [2019-11-16 00:36:54,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1d6da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:54, skipping insertion in model container [2019-11-16 00:36:54,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:36:54" (1/1) ... [2019-11-16 00:36:54,581 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:36:54,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:36:54,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:36:54,987 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:36:55,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:36:55,075 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:36:55,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55 WrapperNode [2019-11-16 00:36:55,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:36:55,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:36:55,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:36:55,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:36:55,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:36:55,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:36:55,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:36:55,119 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:36:55,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... [2019-11-16 00:36:55,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:36:55,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:36:55,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:36:55,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:36:55,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ed567a68-f498-43d3-a016-b8336d576858/bin/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 [2019-11-16 00:36:55,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:36:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:36:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:36:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:36:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:36:55,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:36:55,532 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:36:55,532 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:36:55,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:55 BoogieIcfgContainer [2019-11-16 00:36:55,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:36:55,534 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:36:55,534 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:36:55,536 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:36:55,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:36:55,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:36:54" (1/3) ... [2019-11-16 00:36:55,538 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d7460eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:36:55, skipping insertion in model container [2019-11-16 00:36:55,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:36:55,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:36:55" (2/3) ... [2019-11-16 00:36:55,539 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d7460eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:36:55, skipping insertion in model container [2019-11-16 00:36:55,539 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:36:55,539 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:55" (3/3) ... [2019-11-16 00:36:55,540 INFO L371 chiAutomizerObserver]: Analyzing ICFG array01-alloca-1.i [2019-11-16 00:36:55,581 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:36:55,581 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:36:55,581 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:36:55,582 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:36:55,582 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:36:55,582 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:36:55,582 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:36:55,582 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:36:55,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:36:55,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:55,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:55,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:55,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:36:55,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:36:55,623 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:36:55,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:36:55,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:55,625 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:55,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:55,626 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:36:55,626 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:36:55,633 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L561true assume !(main_~array_size~0 < 1); 14#L561-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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_~res~0 := 0;test_fun_~i~0 := 0; 3#L551-3true [2019-11-16 00:36:55,634 INFO L793 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N); 12#L552-3true assume !true; 13#L551-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 3#L551-3true [2019-11-16 00:36:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-16 00:36:55,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:55,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074092280] [2019-11-16 00:36:55,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:55,762 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:55,763 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-11-16 00:36:55,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:55,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818047469] [2019-11-16 00:36:55,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:55,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:55,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818047469] [2019-11-16 00:36:55,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:36:55,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:36:55,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331549660] [2019-11-16 00:36:55,795 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:36:55,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:36:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:36:55,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:36:55,809 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-11-16 00:36:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:36:55,814 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-11-16 00:36:55,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:36:55,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-11-16 00:36:55,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:55,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-11-16 00:36:55,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:36:55,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:36:55,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-11-16 00:36:55,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:36:55,822 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-16 00:36:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-11-16 00:36:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-11-16 00:36:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-16 00:36:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-11-16 00:36:55,847 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-16 00:36:55,848 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-11-16 00:36:55,848 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:36:55,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-11-16 00:36:55,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-11-16 00:36:55,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:55,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:55,849 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-16 00:36:55,849 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:36:55,850 INFO L791 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L561 assume !(main_~array_size~0 < 1); 41#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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_~res~0 := 0;test_fun_~i~0 := 0; 36#L551-3 [2019-11-16 00:36:55,850 INFO L793 eck$LassoCheckResult]: Loop: 36#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 37#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 40#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 36#L551-3 [2019-11-16 00:36:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-16 00:36:55,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:55,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699593162] [2019-11-16 00:36:55,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:55,880 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-11-16 00:36:55,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:55,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394732290] [2019-11-16 00:36:55,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:55,897 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:55,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:55,898 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-11-16 00:36:55,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:55,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048947387] [2019-11-16 00:36:55,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:55,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:55,946 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:56,305 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-16 00:36:56,316 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:56,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:56,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:56,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:56,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:56,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:56,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:56,318 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:56,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration2_Lasso [2019-11-16 00:36:56,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:56,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:56,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,547 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-16 00:36:56,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:56,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:57,005 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:57,010 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:57,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,016 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:57,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,019 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:57,019 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:57,023 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:57,023 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,025 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:57,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,027 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,029 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:57,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:57,032 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:57,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,034 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:57,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,036 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:57,036 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:57,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:57,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,048 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:57,049 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:57,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:57,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,079 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:57,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:57,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:57,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,092 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:57,092 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,092 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,092 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,093 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:57,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:57,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:57,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,097 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,101 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:57,102 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:57,106 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:57,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,108 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,110 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:57,110 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:57,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:57,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:57,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:57,117 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:57,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:57,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:57,125 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:57,125 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:57,259 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:57,352 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:36:57,357 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-16 00:36:57,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:57,367 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:36:57,368 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:57,369 INFO L512 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 [] [2019-11-16 00:36:57,390 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:36:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:57,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:57,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:57,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:36:57,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:57,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:57,484 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 [2019-11-16 00:36:57,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-11-16 00:36:57,524 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2019-11-16 00:36:57,524 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 [2019-11-16 00:36:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-16 00:36:57,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-16 00:36:57,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:57,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-16 00:36:57,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:57,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-11-16 00:36:57,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:57,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-11-16 00:36:57,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:57,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-11-16 00:36:57,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:36:57,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:36:57,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-16 00:36:57,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:57,532 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-16 00:36:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-16 00:36:57,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-11-16 00:36:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-16 00:36:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-11-16 00:36:57,534 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-16 00:36:57,535 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-16 00:36:57,535 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:36:57,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-11-16 00:36:57,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:57,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:57,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:57,536 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:36:57,542 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:36:57,542 INFO L791 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 116#L561 assume !(main_~array_size~0 < 1); 121#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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_~res~0 := 0;test_fun_~i~0 := 0; 111#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L552-3 [2019-11-16 00:36:57,542 INFO L793 eck$LassoCheckResult]: Loop: 113#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 118#L552-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(test_fun_#t~post5 - 1, 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_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 113#L552-3 [2019-11-16 00:36:57,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:57,543 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-11-16 00:36:57,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:57,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838657674] [2019-11-16 00:36:57,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:57,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:57,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:57,562 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:57,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:57,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-11-16 00:36:57,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:57,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813844071] [2019-11-16 00:36:57,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:57,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:57,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:57,575 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:57,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-11-16 00:36:57,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:57,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357981924] [2019-11-16 00:36:57,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:57,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:57,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:57,602 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:57,776 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-11-16 00:36:57,839 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:57,839 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:57,839 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:57,839 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:57,840 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:57,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:57,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:57,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:57,840 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration3_Lasso [2019-11-16 00:36:57,840 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:57,840 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:57,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:57,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:57,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:57,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:57,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,026 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-16 00:36:58,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,444 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:58,444 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:58,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:58,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:58,446 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:58,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:58,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:58,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:58,447 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:58,447 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:58,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:58,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:58,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:58,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:58,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:58,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:58,453 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:58,454 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:58,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:58,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:58,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:58,473 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:58,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:58,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:58,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:58,474 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:58,474 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:58,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:58,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:58,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:58,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:58,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:58,478 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:58,479 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:58,480 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:58,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:58,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:58,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:58,491 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:58,491 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:58,491 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:58,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:58,492 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:58,492 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:58,500 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:58,504 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:36:58,505 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:36:58,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:58,507 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:36:58,507 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:58,508 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-11-16 00:36:58,514 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:36:58,516 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:36:58,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:58,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:58,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:58,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:36:58,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:58,578 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 [2019-11-16 00:36:58,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-16 00:36:58,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2019-11-16 00:36:58,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:36:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-16 00:36:58,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:36:58,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:58,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:36:58,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:58,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:36:58,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:58,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-11-16 00:36:58,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:58,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-11-16 00:36:58,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:36:58,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:36:58,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-16 00:36:58,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:36:58,606 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-16 00:36:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-16 00:36:58,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-16 00:36:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:36:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-16 00:36:58,608 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-16 00:36:58,608 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-16 00:36:58,608 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:36:58,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-16 00:36:58,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-16 00:36:58,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:36:58,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:36:58,610 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:36:58,610 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:36:58,610 INFO L791 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 205#L561 assume !(main_~array_size~0 < 1); 210#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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_~res~0 := 0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 200#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 209#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 201#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 203#L552-3 [2019-11-16 00:36:58,610 INFO L793 eck$LassoCheckResult]: Loop: 203#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 207#L552-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(test_fun_#t~post5 - 1, 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_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 203#L552-3 [2019-11-16 00:36:58,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-11-16 00:36:58,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:58,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515370623] [2019-11-16 00:36:58,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:58,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:58,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:58,631 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-11-16 00:36:58,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:58,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552395645] [2019-11-16 00:36:58,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:58,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:58,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:58,641 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-11-16 00:36:58,642 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:36:58,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47913261] [2019-11-16 00:36:58,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:58,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:36:58,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:36:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:36:58,673 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:36:58,892 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-11-16 00:36:58,946 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:36:58,946 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:36:58,946 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:36:58,946 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:36:58,946 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:36:58,946 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:36:58,947 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:36:58,947 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:36:58,947 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration4_Lasso [2019-11-16 00:36:58,947 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:36:58,947 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:36:58,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:58,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:36:59,442 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:36:59,442 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:36:59,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,443 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,443 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:59,443 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,443 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,443 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:59,444 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:59,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,445 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,445 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,446 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:59,446 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:59,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,449 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,449 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,450 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:59,450 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:59,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,458 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,458 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,459 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:59,459 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:59,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,462 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:59,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,463 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,463 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:59,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:59,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,465 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:59,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,465 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:59,466 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:59,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,467 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,469 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:59,469 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:59,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,472 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-16 00:36:59,472 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,472 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,474 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-16 00:36:59,474 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:59,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,483 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,484 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,486 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:59,486 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:59,490 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,491 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,492 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,492 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,492 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,494 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:59,494 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:59,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,505 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,506 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,506 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,507 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:36:59,507 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:36:59,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:36:59,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-16 00:36:59,510 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:36:59,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:36:59,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:36:59,510 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:36:59,511 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:36:59,511 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:36:59,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:36:59,512 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:36:59,514 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:36:59,514 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:36:59,514 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:36:59,514 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:36:59,515 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:36:59,515 INFO L512 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 (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-11-16 00:36:59,523 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-16 00:36:59,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:36:59,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:59,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:59,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:59,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:36:59,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:59,585 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 [2019-11-16 00:36:59,585 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-16 00:36:59,608 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2019-11-16 00:36:59,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:36:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-16 00:36:59,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:36:59,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:59,609 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:36:59,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:59,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:59,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:59,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:36:59,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:59,653 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 [2019-11-16 00:36:59,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-16 00:36:59,667 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2019-11-16 00:36:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:36:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-11-16 00:36:59,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:36:59,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:59,668 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-16 00:36:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:36:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:59,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:36:59,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:36:59,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:36:59,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:36:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:36:59,734 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 [2019-11-16 00:36:59,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-16 00:36:59,748 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2019-11-16 00:36:59,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:36:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:36:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-16 00:36:59,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-16 00:36:59,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:59,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-16 00:36:59,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:59,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-16 00:36:59,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:36:59,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-11-16 00:36:59,753 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:36:59,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2019-11-16 00:36:59,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:36:59,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:36:59,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:36:59,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:36:59,753 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:36:59,753 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:36:59,753 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:36:59,753 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:36:59,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:36:59,754 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:36:59,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:36:59,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:36:59 BoogieIcfgContainer [2019-11-16 00:36:59,758 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:36:59,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:36:59,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:36:59,759 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:36:59,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:36:55" (3/4) ... [2019-11-16 00:36:59,761 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:36:59,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:36:59,762 INFO L168 Benchmark]: Toolchain (without parser) took 5197.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -245.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:59,763 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:59,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:59,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:59,764 INFO L168 Benchmark]: Boogie Preprocessor took 50.26 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:59,765 INFO L168 Benchmark]: RCFGBuilder took 364.74 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:36:59,766 INFO L168 Benchmark]: BuchiAutomizer took 4224.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:59,766 INFO L168 Benchmark]: Witness Printer took 3.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:36:59,769 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 509.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.26 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 364.74 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4224.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.07 ms. Allocated memory is still 1.2 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] 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 4.1s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 33 SDslu, 1 SDs, 0 SdLazy, 43 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax113 hnf99 lsp80 ukn81 mio100 lsp57 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 5 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...