./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array04_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/array04_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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.25-8bd4bc6 [2020-07-29 01:37:47,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:37:47,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:37:47,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:37:47,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:37:47,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:37:47,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:37:47,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:37:47,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:37:47,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:37:47,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:37:47,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:37:47,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:37:47,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:37:47,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:37:47,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:37:47,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:37:47,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:37:47,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:37:47,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:37:47,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:37:47,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:37:47,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:37:47,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:37:47,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:37:47,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:37:47,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:37:47,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:37:47,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:37:47,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:37:47,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:37:47,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:37:47,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:37:47,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:37:47,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:37:47,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:37:47,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:37:47,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:37:47,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:37:47,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:37:47,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:37:47,120 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:37:47,136 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:37:47,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:37:47,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:37:47,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:37:47,138 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:37:47,139 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:37:47,139 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:37:47,139 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:37:47,139 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:37:47,139 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:37:47,140 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:37:47,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:37:47,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:37:47,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:37:47,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:37:47,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:37:47,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:37:47,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:37:47,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:37:47,142 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:37:47,142 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:37:47,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:37:47,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:37:47,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:37:47,143 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:37:47,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:37:47,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:37:47,143 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:37:47,144 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:37:47,144 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:37:47,145 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ede187b1b02320b6ac4ee708403ec99e5631a2e0 [2020-07-29 01:37:47,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:37:47,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:37:47,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:37:47,453 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:37:47,454 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:37:47,455 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array04_alloca.i [2020-07-29 01:37:47,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5761b57d4/44683745946c4bd89d8d8358325076b2/FLAG73b1bffd4 [2020-07-29 01:37:48,111 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:37:48,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array04_alloca.i [2020-07-29 01:37:48,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5761b57d4/44683745946c4bd89d8d8358325076b2/FLAG73b1bffd4 [2020-07-29 01:37:48,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5761b57d4/44683745946c4bd89d8d8358325076b2 [2020-07-29 01:37:48,465 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:37:48,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:37:48,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:48,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:37:48,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:37:48,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:48" (1/1) ... [2020-07-29 01:37:48,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c347dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:48, skipping insertion in model container [2020-07-29 01:37:48,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:37:48" (1/1) ... [2020-07-29 01:37:48,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:37:48,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:37:49,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:49,123 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:37:49,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:37:49,236 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:37:49,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49 WrapperNode [2020-07-29 01:37:49,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:37:49,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:49,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:37:49,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:37:49,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:37:49,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:37:49,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:37:49,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:37:49,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... [2020-07-29 01:37:49,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:37:49,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:37:49,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:37:49,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:37:49,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:37:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:37:49,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:37:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:37:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:37:49,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:37:49,725 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:37:49,726 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:37:49,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:49 BoogieIcfgContainer [2020-07-29 01:37:49,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:37:49,731 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:37:49,731 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:37:49,736 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:37:49,737 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:49,738 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:37:48" (1/3) ... [2020-07-29 01:37:49,739 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56195065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:49, skipping insertion in model container [2020-07-29 01:37:49,739 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:49,740 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:37:49" (2/3) ... [2020-07-29 01:37:49,740 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56195065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:37:49, skipping insertion in model container [2020-07-29 01:37:49,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:37:49,741 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:49" (3/3) ... [2020-07-29 01:37:49,743 INFO L371 chiAutomizerObserver]: Analyzing ICFG array04_alloca.i [2020-07-29 01:37:49,801 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:37:49,801 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:37:49,801 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:37:49,801 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:37:49,802 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:37:49,802 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:37:49,802 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:37:49,803 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:37:49,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:37:49,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:49,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:49,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:49,848 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:49,849 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:49,849 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:37:49,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:37:49,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:49,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:49,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:49,853 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:37:49,853 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:37:49,860 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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 [2020-07-29 01:37:49,860 INFO L796 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 [2020-07-29 01:37:49,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:37:49,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:49,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549934173] [2020-07-29 01:37:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:49,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:49,976 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:50,004 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:50,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2020-07-29 01:37:50,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:50,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025160024] [2020-07-29 01:37:50,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:50,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:50,031 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:50,034 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:50,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:50,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2020-07-29 01:37:50,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:50,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32647871] [2020-07-29 01:37:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:50,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:50,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:50,101 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:50,372 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:37:50,373 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:37:50,373 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:37:50,373 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:37:50,373 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:37:50,374 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:50,374 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:37:50,374 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:37:50,374 INFO L133 ssoRankerPreferences]: Filename of dumped script: array04_alloca.i_Iteration1_Lasso [2020-07-29 01:37:50,374 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:37:50,375 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:37:50,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:50,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:50,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:50,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:50,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:50,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:50,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:50,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:37:51,061 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:37:51,067 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:51,073 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 [2020-07-29 01:37:51,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:51,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:51,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:51,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:51,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:51,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:51,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:37:51,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:51,121 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 [2020-07-29 01:37:51,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:51,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:51,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:51,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:51,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:51,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:51,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:51,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:51,170 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 [2020-07-29 01:37:51,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:51,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:51,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:51,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:51,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:51,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:51,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:51,244 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 [2020-07-29 01:37:51,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:51,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:37:51,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:51,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:51,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:37:51,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:37:51,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:51,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:37:51,295 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 [2020-07-29 01:37:51,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:37:51,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:37:51,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:37:51,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:51,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:37:51,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:37:51,345 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:37:51,393 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:37:51,393 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 14 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:37:51,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:37:51,406 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:37:51,407 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:37:51,408 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1) = -4*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~arr~0.offset + 2*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 Supporting invariants [] [2020-07-29 01:37:51,472 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:37:51,482 INFO L393 LassoCheck]: Loop: "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;" "main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207;" [2020-07-29 01:37:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:51,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:37:51,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:51,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:37:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:51,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:51,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {23#unseeded} is VALID [2020-07-29 01:37:51,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#unseeded} 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; {23#unseeded} is VALID [2020-07-29 01:37:51,607 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#unseeded} assume !(main_~length~0 < 1); {23#unseeded} is VALID [2020-07-29 01:37:51,608 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#unseeded} 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; {52#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:37:51,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {52#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {52#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:37:51,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:51,617 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:37:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:51,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:37:51,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#(and (>= oldRank0 (+ (* (- 4) ULTIMATE.start_main_~i~0) (* (- 1) ULTIMATE.start_main_~arr~0.offset) (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc206.base|)))) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|))} 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; {73#(and (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc206.base|)) (+ ULTIMATE.start_main_~arr~0.offset oldRank0 (* 4 ULTIMATE.start_main_~i~0))) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0) 4) (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= 0 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0))))} is VALID [2020-07-29 01:37:51,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(and (<= (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc206.base|)) (+ ULTIMATE.start_main_~arr~0.offset oldRank0 (* 4 ULTIMATE.start_main_~i~0))) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0) 4) (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= 0 (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0))))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {55#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (or (and (> oldRank0 (+ (* (- 4) ULTIMATE.start_main_~i~0) (* (- 1) ULTIMATE.start_main_~arr~0.offset) (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc206.base|)))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:37:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:51,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:51,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:51,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:51,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,717 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:37:51,719 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2020-07-29 01:37:51,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 27 states and 37 transitions. Complement of second has 9 states. [2020-07-29 01:37:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:37:51,891 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:51,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:37:51,895 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:51,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:51,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:51,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:37:51,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:51,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:51,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:51,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2020-07-29 01:37:51,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:37:51,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:51,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:51,919 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 01:37:51,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:51,925 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:37:51,925 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:37:51,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:37:51,932 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:37:51,932 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 37 transitions. cyclomatic complexity: 14 [2020-07-29 01:37:51,933 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:37:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:51,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:37:51,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:37:51,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:37:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:37:51,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:37:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:37:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:37:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:37:51,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:37:51,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:51,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:51,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:37:51,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:51,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:51,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:51,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:37:51,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:37:51,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:37:51,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:51,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:51,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:37:51,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 37 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:37:51,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,973 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:37:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:37:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-29 01:37:51,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:37:51,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:37:51,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:37:51,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:37:51,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. cyclomatic complexity: 14 [2020-07-29 01:37:51,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:37:52,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 10 states and 13 transitions. [2020-07-29 01:37:52,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:37:52,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:37:52,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-07-29 01:37:52,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:52,013 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-07-29 01:37:52,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:37:52,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:52,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:52,044 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:52,047 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:52,051 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:37:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:52,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:52,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:52,053 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:37:52,054 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:37:52,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:52,055 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:37:52,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:52,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:52,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:52,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:52,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:37:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:37:52,059 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:52,059 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:37:52,060 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:37:52,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:37:52,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:37:52,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:52,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:52,061 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:52,062 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:37:52,062 INFO L794 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 119#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; 120#L367 assume !(main_~length~0 < 1); 123#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; 124#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 125#L370-3 assume !(main_~i~0 < main_~length~0); 121#L370-4 main_~j~0 := 0; 118#L374-2 [2020-07-29 01:37:52,062 INFO L796 eck$LassoCheckResult]: Loop: 118#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; 118#L374-2 [2020-07-29 01:37:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2020-07-29 01:37:52,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:52,064 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117570868] [2020-07-29 01:37:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:37:52,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {151#true} is VALID [2020-07-29 01:37:52,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#true} 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; {151#true} is VALID [2020-07-29 01:37:52,139 INFO L280 TraceCheckUtils]: 2: Hoare triple {151#true} assume !(main_~length~0 < 1); {153#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:37:52,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {153#(<= 1 ULTIMATE.start_main_~length~0)} 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; {153#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:37:52,141 INFO L280 TraceCheckUtils]: 4: Hoare triple {153#(<= 1 ULTIMATE.start_main_~length~0)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {154#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:37:52,142 INFO L280 TraceCheckUtils]: 5: Hoare triple {154#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} assume !(main_~i~0 < main_~length~0); {152#false} is VALID [2020-07-29 01:37:52,143 INFO L280 TraceCheckUtils]: 6: Hoare triple {152#false} main_~j~0 := 0; {152#false} is VALID [2020-07-29 01:37:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:37:52,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117570868] [2020-07-29 01:37:52,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:37:52,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:37:52,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504322341] [2020-07-29 01:37:52,149 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:37:52,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:52,150 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2020-07-29 01:37:52,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:52,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133479753] [2020-07-29 01:37:52,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:52,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:52,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:52,163 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:52,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:37:52,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:37:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:37:52,208 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:37:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:52,258 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:37:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:37:52,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:37:52,269 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:37:52,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-07-29 01:37:52,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:37:52,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 01:37:52,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:37:52,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:37:52,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-07-29 01:37:52,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:37:52,273 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 01:37:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-07-29 01:37:52,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:37:52,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:37:52,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:52,275 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:52,275 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:37:52,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:52,276 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:37:52,277 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:37:52,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:52,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:52,278 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:37:52,278 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:37:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:37:52,279 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:37:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:37:52,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:37:52,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:37:52,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:37:52,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:37:52,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:37:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-07-29 01:37:52,282 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:37:52,282 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:37:52,282 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:37:52,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-07-29 01:37:52,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:37:52,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:37:52,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:37:52,284 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:37:52,284 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:37:52,285 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 169#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; 170#L367 assume !(main_~length~0 < 1); 173#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; 174#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 175#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; 176#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 177#L370-3 assume !(main_~i~0 < main_~length~0); 171#L370-4 main_~j~0 := 0; 168#L374-2 [2020-07-29 01:37:52,285 INFO L796 eck$LassoCheckResult]: Loop: 168#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; 168#L374-2 [2020-07-29 01:37:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2020-07-29 01:37:52,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:52,286 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855795238] [2020-07-29 01:37:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:52,300 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:52,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:52,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:52,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:52,317 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2020-07-29 01:37:52,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:52,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460565686] [2020-07-29 01:37:52,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:52,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:52,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:52,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:37:52,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2020-07-29 01:37:52,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:37:52,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013040037] [2020-07-29 01:37:52,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:37:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:52,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:37:52,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:37:52,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:37:52,615 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2020-07-29 01:37:52,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:37:52 BoogieIcfgContainer [2020-07-29 01:37:52,738 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:37:52,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:37:52,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:37:52,739 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:37:52,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:37:49" (3/4) ... [2020-07-29 01:37:52,748 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:37:52,866 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:37:52,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:37:52,871 INFO L168 Benchmark]: Toolchain (without parser) took 4402.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 954.9 MB in the beginning and 1.2 GB in the end (delta: -204.0 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:52,872 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:37:52,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:52,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.97 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. [2020-07-29 01:37:52,877 INFO L168 Benchmark]: Boogie Preprocessor took 29.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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:52,878 INFO L168 Benchmark]: RCFGBuilder took 410.51 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:52,879 INFO L168 Benchmark]: BuchiAutomizer took 3006.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -62.7 MB). Peak memory consumption was 287.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:37:52,882 INFO L168 Benchmark]: Witness Printer took 128.38 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. [2020-07-29 01:37:52,889 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 768.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.97 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 29.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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 410.51 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3006.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -62.7 MB). Peak memory consumption was 287.1 MB. Max. memory is 11.5 GB. * Witness Printer took 128.38 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 #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 -4 * i + -1 * arr + 2 * unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 6 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.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.2s. 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 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: 15 SDtfs, 19 SDslu, 11 SDs, 0 SdLazy, 29 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax100 hnf99 lsp93 ukn82 mio100 lsp64 div100 bol100 ite100 ukn100 eq167 hnf91 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms 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=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@54d67008=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ba9148c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7395ee6b=0, length=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@177e669e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7395ee6b=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@1e4876b2=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