./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array04_alloca.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_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array04_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/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 ede187b1b02320b6ac4ee708403ec99e5631a2e0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:15:20,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:15:20,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:15:20,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:15:20,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:15:20,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:15:20,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:15:20,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:15:20,468 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:15:20,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:15:20,470 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:15:20,471 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:15:20,472 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:15:20,473 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:15:20,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:15:20,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:15:20,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:15:20,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:15:20,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:15:20,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:15:20,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:15:20,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:15:20,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:15:20,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:15:20,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:15:20,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:15:20,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:15:20,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:15:20,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:15:20,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:15:20,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:15:20,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:15:20,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:15:20,494 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:15:20,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:15:20,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:15:20,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:15:20,499 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:15:20,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:15:20,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:15:20,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:15:20,505 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:15:20,525 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:15:20,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:15:20,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:15:20,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:15:20,527 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:15:20,527 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:15:20,527 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:15:20,528 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:15:20,528 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:15:20,528 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:15:20,528 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:15:20,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:15:20,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:15:20,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:15:20,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:15:20,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:15:20,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:15:20,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:15:20,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:15:20,531 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:15:20,531 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:15:20,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:15:20,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:15:20,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:15:20,532 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:15:20,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:15:20,533 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:15:20,533 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:15:20,534 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:15:20,534 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_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/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 -> ede187b1b02320b6ac4ee708403ec99e5631a2e0 [2019-11-16 00:15:20,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:15:20,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:15:20,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:15:20,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:15:20,595 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:15:20,597 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/../../sv-benchmarks/c/termination-15/array04_alloca.i [2019-11-16 00:15:20,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/data/50a87b747/ffb01f8bfe794c45b27f69aaed88ce52/FLAG61331c6e0 [2019-11-16 00:15:21,142 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:15:21,143 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/sv-benchmarks/c/termination-15/array04_alloca.i [2019-11-16 00:15:21,152 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/data/50a87b747/ffb01f8bfe794c45b27f69aaed88ce52/FLAG61331c6e0 [2019-11-16 00:15:21,617 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/data/50a87b747/ffb01f8bfe794c45b27f69aaed88ce52 [2019-11-16 00:15:21,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:15:21,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:15:21,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:15:21,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:15:21,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:15:21,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:15:21" (1/1) ... [2019-11-16 00:15:21,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5476c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:21, skipping insertion in model container [2019-11-16 00:15:21,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:15:21" (1/1) ... [2019-11-16 00:15:21,642 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:15:21,675 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:15:22,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:15:22,083 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:15:22,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:15:22,192 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:15:22,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22 WrapperNode [2019-11-16 00:15:22,192 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:15:22,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:15:22,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:15:22,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:15:22,203 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:15:22" (1/1) ... [2019-11-16 00:15:22,218 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:15:22" (1/1) ... [2019-11-16 00:15:22,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:15:22,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:15:22,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:15:22,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:15:22,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... [2019-11-16 00:15:22,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:15:22,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:15:22,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:15:22,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:15:22,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/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:15:22,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:15:22,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:15:22,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:15:22,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:15:22,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:15:22,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:15:22,556 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:15:22,556 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-16 00:15:22,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:15:22 BoogieIcfgContainer [2019-11-16 00:15:22,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:15:22,558 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:15:22,559 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:15:22,562 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:15:22,564 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:15:22,564 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:15:21" (1/3) ... [2019-11-16 00:15:22,565 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@284f0718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:15:22, skipping insertion in model container [2019-11-16 00:15:22,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:15:22,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:15:22" (2/3) ... [2019-11-16 00:15:22,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@284f0718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:15:22, skipping insertion in model container [2019-11-16 00:15:22,566 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:15:22,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:15:22" (3/3) ... [2019-11-16 00:15:22,568 INFO L371 chiAutomizerObserver]: Analyzing ICFG array04_alloca.i [2019-11-16 00:15:22,629 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:15:22,629 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:15:22,630 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:15:22,630 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:15:22,630 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:15:22,630 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:15:22,645 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:15:22,645 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:15:22,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:15:22,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-16 00:15:22,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:15:22,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:15:22,726 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:15:22,726 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:15:22,726 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:15:22,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-16 00:15:22,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2019-11-16 00:15:22,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:15:22,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:15:22,729 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-16 00:15:22,729 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:15:22,737 INFO L791 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 14#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 11#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 15#L370-3true [2019-11-16 00:15:22,738 INFO L793 eck$LassoCheckResult]: Loop: 15#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 13#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L370-3true [2019-11-16 00:15:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-16 00:15:22,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:22,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029004220] [2019-11-16 00:15:22,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:22,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:22,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:22,907 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:15:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2019-11-16 00:15:22,909 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:22,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994831771] [2019-11-16 00:15:22,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:22,909 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:22,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:22,925 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:15:22,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:22,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2019-11-16 00:15:22,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:22,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138478992] [2019-11-16 00:15:22,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:22,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:22,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:22,958 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:15:23,160 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-16 00:15:23,224 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:15:23,225 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:15:23,225 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:15:23,225 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:15:23,225 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:15:23,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:15:23,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:15:23,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:15:23,226 INFO L131 ssoRankerPreferences]: Filename of dumped script: array04_alloca.i_Iteration1_Lasso [2019-11-16 00:15:23,226 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:15:23,227 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:15:23,249 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:15:23,256 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:15:23,258 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:15:23,267 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:15:23,269 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:15:23,384 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:15:23,387 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:15:23,390 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:15:23,700 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:15:23,706 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:15:23,708 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:15:23,711 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:15:23,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:15:23,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:15:23,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:15:23,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:15:23,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:15:23,717 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:15:23,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:15:23,723 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:15:23,725 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:15:23,725 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:15:23,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:15:23,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:15:23,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:15:23,727 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:15:23,728 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:15:23,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:15:23,733 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:15:23,735 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:15:23,735 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:15:23,736 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:15:23,736 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:15:23,742 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:15:23,742 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:15:23,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:15:23,770 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:15:23,771 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:15:23,771 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:15:23,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:15:23,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:15:23,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:15:23,772 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:15:23,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:15:23,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:15:23,774 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:15:23,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:15:23,777 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:15:23,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:15:23,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:15:23,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:15:23,786 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:15:23,879 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:15:23,908 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:15:23,908 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:15:23,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:15:23,927 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:15:23,927 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:15:23,928 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset Supporting invariants [] [2019-11-16 00:15:23,949 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-16 00:15:23,960 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-16 00:15:23,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:24,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:15:24,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:15:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:24,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:15:24,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:15:24,034 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:15:24,051 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:15:24,052 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2019-11-16 00:15:24,107 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 7 states. [2019-11-16 00:15:24,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:15:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:15:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-11-16 00:15:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-16 00:15:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:15:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-16 00:15:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:15:24,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-11-16 00:15:24,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:15:24,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-11-16 00:15:24,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:15:24,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 10 states and 13 transitions. [2019-11-16 00:15:24,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:15:24,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:15:24,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-11-16 00:15:24,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:15:24,130 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:15:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-11-16 00:15:24,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:15:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:15:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-11-16 00:15:24,157 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:15:24,157 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-11-16 00:15:24,157 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:15:24,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-11-16 00:15:24,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:15:24,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:15:24,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:15:24,161 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:24,161 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:15:24,161 INFO L791 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 105#L367 assume !(main_~length~0 < 1); 108#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 109#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 110#L370-3 assume !(main_~i~0 < main_~length~0); 106#L370-4 main_~j~0 := 0; 103#L374-2 [2019-11-16 00:15:24,162 INFO L793 eck$LassoCheckResult]: Loop: 103#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 + main_#t~mem209;havoc main_#t~mem209; 103#L374-2 [2019-11-16 00:15:24,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:24,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2019-11-16 00:15:24,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:24,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198906438] [2019-11-16 00:15:24,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:15:24,220 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:15:24,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198906438] [2019-11-16 00:15:24,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:15:24,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:15:24,222 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396377983] [2019-11-16 00:15:24,224 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:15:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2019-11-16 00:15:24,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:24,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795116413] [2019-11-16 00:15:24,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:24,239 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:15:24,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:15:24,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:15:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:15:24,282 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-16 00:15:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:15:24,313 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-11-16 00:15:24,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:15:24,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-11-16 00:15:24,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:15:24,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2019-11-16 00:15:24,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-16 00:15:24,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-16 00:15:24,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2019-11-16 00:15:24,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:15:24,316 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-11-16 00:15:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2019-11-16 00:15:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-16 00:15:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:15:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-11-16 00:15:24,317 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-16 00:15:24,318 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-11-16 00:15:24,318 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:15:24,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2019-11-16 00:15:24,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-11-16 00:15:24,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:15:24,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:15:24,319 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:15:24,319 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-11-16 00:15:24,319 INFO L791 eck$LassoCheckResult]: Stem: 135#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 132#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~post207, main_#t~mem209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 133#L367 assume !(main_~length~0 < 1); 136#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 137#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 138#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208; 139#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 140#L370-3 assume !(main_~i~0 < main_~length~0); 134#L370-4 main_~j~0 := 0; 131#L374-2 [2019-11-16 00:15:24,320 INFO L793 eck$LassoCheckResult]: Loop: 131#L374-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_~j~0 := main_~j~0 + main_#t~mem209;havoc main_#t~mem209; 131#L374-2 [2019-11-16 00:15:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2019-11-16 00:15:24,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:24,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197107556] [2019-11-16 00:15:24,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,322 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:24,351 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:15:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:24,352 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2019-11-16 00:15:24,352 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:24,352 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768337680] [2019-11-16 00:15:24,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:24,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:15:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:15:24,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2019-11-16 00:15:24,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:15:24,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793804606] [2019-11-16 00:15:24,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:15:24,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:15:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:15:24,384 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:15:24,584 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2019-11-16 00:15:24,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:15:24 BoogieIcfgContainer [2019-11-16 00:15:24,687 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:15:24,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:15:24,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:15:24,688 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:15:24,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:15:22" (3/4) ... [2019-11-16 00:15:24,694 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-16 00:15:24,760 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e9b2a7d4-8201-4d35-8aac-b1d186320ae6/bin/uautomizer/witness.graphml [2019-11-16 00:15:24,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:15:24,769 INFO L168 Benchmark]: Toolchain (without parser) took 3144.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 938.0 MB in the beginning and 908.7 MB in the end (delta: 29.3 MB). Peak memory consumption was 156.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:15:24,775 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:15:24,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:15:24,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.66 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:15:24,778 INFO L168 Benchmark]: Boogie Preprocessor took 25.77 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:15:24,778 INFO L168 Benchmark]: RCFGBuilder took 290.38 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:15:24,781 INFO L168 Benchmark]: BuchiAutomizer took 2128.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.1 MB in the end (delta: 168.1 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:15:24,781 INFO L168 Benchmark]: Witness Printer took 77.14 ms. Allocated memory is still 1.2 GB. Free memory was 914.1 MB in the beginning and 908.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:15:24,784 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.63 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 570.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.66 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 25.77 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 290.38 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: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2128.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.1 MB in the end (delta: 168.1 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. * Witness Printer took 77.14 ms. Allocated memory is still 1.2 GB. Free memory was 914.1 MB in the beginning and 908.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[arr] + -4 * i + -1 * arr and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 20 SDtfs, 24 SDslu, 12 SDs, 0 SdLazy, 22 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital101 mio100 ax100 hnf99 lsp93 ukn80 mio100 lsp63 div100 bol100 ite100 ukn100 eq166 hnf91 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 374]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {NULL=0, \result=0, NULL=0, arr=-1, arr=0, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2642a93=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4bd84863=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f534c6f=0, length=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@7cefde3b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5f534c6f=-1, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@36d0f8ce=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 374]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i