./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array07_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/array07_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 77498d00b446eec99f943fd8f68173cd9df2461a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:38:06,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:38:06,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:38:06,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:38:06,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:38:06,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:38:06,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:38:06,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:38:06,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:38:06,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:38:06,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:38:06,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:38:06,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:38:06,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:38:06,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:38:06,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:38:06,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:38:06,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:38:06,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:38:06,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:38:06,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:38:06,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:38:06,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:38:06,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:38:06,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:38:06,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:38:06,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:38:06,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:38:06,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:38:06,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:38:06,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:38:06,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:38:06,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:38:06,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:38:06,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:38:06,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:38:06,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:38:06,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:38:06,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:38:06,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:38:06,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:38:06,517 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:38:06,552 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:38:06,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:38:06,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:38:06,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:38:06,556 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:38:06,556 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:38:06,557 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:38:06,557 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:38:06,557 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:38:06,557 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:38:06,559 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:38:06,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:38:06,559 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:38:06,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:38:06,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:38:06,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:38:06,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:38:06,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:38:06,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:38:06,561 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:38:06,562 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:38:06,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:38:06,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:38:06,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:38:06,563 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:38:06,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:38:06,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:38:06,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:38:06,564 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:38:06,566 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:38:06,566 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 -> 77498d00b446eec99f943fd8f68173cd9df2461a [2020-07-29 01:38:06,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:38:06,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:38:06,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:38:06,932 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:38:06,934 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:38:06,936 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array07_alloca.i [2020-07-29 01:38:07,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59dc41c8/2d19e0a0d7ef420cb5c8706a51aa4157/FLAGa3d98b10e [2020-07-29 01:38:07,477 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:38:07,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array07_alloca.i [2020-07-29 01:38:07,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59dc41c8/2d19e0a0d7ef420cb5c8706a51aa4157/FLAGa3d98b10e [2020-07-29 01:38:07,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c59dc41c8/2d19e0a0d7ef420cb5c8706a51aa4157 [2020-07-29 01:38:07,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:38:07,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:38:07,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:38:07,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:38:07,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:38:07,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:38:07" (1/1) ... [2020-07-29 01:38:07,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8b4eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:07, skipping insertion in model container [2020-07-29 01:38:07,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:38:07" (1/1) ... [2020-07-29 01:38:07,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:38:07,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:38:08,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:38:08,274 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:38:08,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:38:08,448 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:38:08,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08 WrapperNode [2020-07-29 01:38:08,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:38:08,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:38:08,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:38:08,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:38:08,463 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:38:08" (1/1) ... [2020-07-29 01:38:08,497 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:38:08" (1/1) ... [2020-07-29 01:38:08,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:38:08,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:38:08,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:38:08,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:38:08,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (1/1) ... [2020-07-29 01:38:08,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (1/1) ... [2020-07-29 01:38:08,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (1/1) ... [2020-07-29 01:38:08,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (1/1) ... [2020-07-29 01:38:08,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (1/1) ... [2020-07-29 01:38:08,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (1/1) ... [2020-07-29 01:38:08,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (1/1) ... [2020-07-29 01:38:08,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:38:08,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:38:08,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:38:08,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:38:08,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (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:38:08,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:38:08,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:38:08,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:38:08,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:38:08,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:38:08,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:38:08,987 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:38:08,988 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:38:08,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:08 BoogieIcfgContainer [2020-07-29 01:38:08,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:38:08,993 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:38:08,993 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:38:08,997 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:38:08,998 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:08,998 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:38:07" (1/3) ... [2020-07-29 01:38:08,999 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d98bb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:38:08, skipping insertion in model container [2020-07-29 01:38:09,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:09,000 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:08" (2/3) ... [2020-07-29 01:38:09,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d98bb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:38:09, skipping insertion in model container [2020-07-29 01:38:09,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:09,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:08" (3/3) ... [2020-07-29 01:38:09,003 INFO L371 chiAutomizerObserver]: Analyzing ICFG array07_alloca.i [2020-07-29 01:38:09,061 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:38:09,062 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:38:09,062 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:38:09,062 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:38:09,063 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:38:09,063 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:38:09,063 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:38:09,063 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:38:09,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:38:09,115 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:09,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:09,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:09,123 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:38:09,123 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:09,123 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:38:09,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:38:09,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:09,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:09,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:09,132 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:38:09,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:09,142 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_#t~post210, 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:38:09,143 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:38:09,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:09,150 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:38:09,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:09,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326645454] [2020-07-29 01:38:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:09,262 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:09,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:09,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:09,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2020-07-29 01:38:09,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:09,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927780066] [2020-07-29 01:38:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:09,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:09,315 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:09,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:09,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2020-07-29 01:38:09,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:09,321 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934354686] [2020-07-29 01:38:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:09,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:09,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:09,368 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:09,649 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:09,650 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:09,650 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:09,651 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:09,651 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:09,651 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:09,651 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:09,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:09,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: array07_alloca.i_Iteration1_Lasso [2020-07-29 01:38:09,652 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:09,653 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:09,696 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:38:09,707 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:38:09,712 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:38:09,719 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:38:09,724 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:38:09,869 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:38:09,874 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:38:09,879 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:38:09,885 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:38:10,370 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:10,377 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) [2020-07-29 01:38:10,385 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:38:10,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:10,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:10,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:10,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:10,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:10,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:10,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:10,398 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:38:10,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:38:10,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:10,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:10,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:10,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:10,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:10,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:10,446 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:38:10,449 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) [2020-07-29 01:38:10,488 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:38:10,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:10,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:10,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:10,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:10,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:10,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:10,500 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:38:10,539 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:38:10,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:10,542 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:10,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:10,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:10,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:10,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:10,544 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:38:10,546 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:10,588 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:38:10,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:10,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:10,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:10,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:10,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:10,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:10,617 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:10,756 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:38:10,756 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:38:10,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:10,767 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:10,768 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:10,769 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:38:10,845 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:10,852 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:38:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:10,869 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:38:10,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:10,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:10,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:10,961 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:38:10,962 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_#t~post210, 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:38:10,963 INFO L280 TraceCheckUtils]: 2: Hoare triple {23#unseeded} assume !(main_~length~0 < 1); {23#unseeded} is VALID [2020-07-29 01:38:10,964 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:38:10,965 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:38:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:10,973 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:38:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:10,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:11,014 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:38:11,016 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:38:11,016 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:38:11,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:11,042 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:38:11,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:11,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,052 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:38:11,054 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2020-07-29 01:38:11,198 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:38:11,198 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:38:11,199 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:11,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:38:11,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:11,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:11,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:11,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:38:11,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:11,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:11,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:11,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2020-07-29 01:38:11,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:11,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:11,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:11,212 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states. [2020-07-29 01:38:11,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:11,215 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:38:11,216 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:38:11,219 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:11,219 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:11,220 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 37 transitions. cyclomatic complexity: 14 [2020-07-29 01:38:11,220 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:11,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:11,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:11,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,221 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:38:11,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:11,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:11,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,223 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:38:11,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:11,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:11,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,224 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:38:11,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:38:11,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:38:11,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,226 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:38:11,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:38:11,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:38:11,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,227 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:38:11,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:38:11,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:38:11,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,229 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:38:11,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:11,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:11,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,230 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:38:11,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:38:11,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:38:11,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,232 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:38:11,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:11,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:11,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,233 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:38:11,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:11,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:38:11,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,235 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:38:11,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:11,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:11,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,237 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:38:11,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:11,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:38:11,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,238 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:38:11,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,238 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:11,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:38:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-29 01:38:11,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:38:11,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:11,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:38:11,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:11,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. cyclomatic complexity: 14 [2020-07-29 01:38:11,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:11,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 10 states and 13 transitions. [2020-07-29 01:38:11,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:38:11,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:38:11,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2020-07-29 01:38:11,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:11,258 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:38:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2020-07-29 01:38:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:38:11,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:11,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:11,292 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:11,295 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:11,300 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:38:11,301 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:38:11,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:11,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:11,302 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:38:11,302 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 13 transitions. [2020-07-29 01:38:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:11,304 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:38:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:38:11,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:11,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:11,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:11,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:38:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:38:11,308 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:38:11,308 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:38:11,308 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:38:11,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:38:11,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:11,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:11,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:11,310 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:11,310 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:38:11,310 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_#t~post210, 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:38:11,311 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_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 118#L374-2 [2020-07-29 01:38:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2020-07-29 01:38:11,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:11,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339991158] [2020-07-29 01:38:11,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:11,406 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:38:11,406 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_#t~post210, 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:38:11,407 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:38:11,409 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:38:11,410 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:38:11,411 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:38:11,412 INFO L280 TraceCheckUtils]: 6: Hoare triple {152#false} main_~j~0 := 0; {152#false} is VALID [2020-07-29 01:38:11,413 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:38:11,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339991158] [2020-07-29 01:38:11,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:38:11,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:38:11,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162256321] [2020-07-29 01:38:11,420 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:11,420 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 1 times [2020-07-29 01:38:11,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:11,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352774664] [2020-07-29 01:38:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:11,429 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:11,435 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:11,437 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:11,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:11,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:38:11,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:38:11,494 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 01:38:11,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:11,559 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:38:11,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:38:11,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:11,571 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:38:11,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2020-07-29 01:38:11,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:11,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 01:38:11,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:38:11,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:38:11,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2020-07-29 01:38:11,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:11,576 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 01:38:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2020-07-29 01:38:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:38:11,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:11,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:11,578 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:11,578 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 10 states. [2020-07-29 01:38:11,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:11,580 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:38:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:38:11,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:11,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:11,603 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:38:11,603 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 13 transitions. [2020-07-29 01:38:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:11,605 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2020-07-29 01:38:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:38:11,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:11,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:11,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:11,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:11,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:38:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-07-29 01:38:11,607 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:38:11,608 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:38:11,608 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:38:11,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-07-29 01:38:11,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:11,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:11,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:11,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:11,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:38:11,632 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_#t~post210, 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:38:11,632 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_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; 168#L374-2 [2020-07-29 01:38:11,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:11,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1182969107, now seen corresponding path program 1 times [2020-07-29 01:38:11,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:11,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652246850] [2020-07-29 01:38:11,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:11,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:11,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:11,684 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash 68, now seen corresponding path program 2 times [2020-07-29 01:38:11,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:11,685 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595913182] [2020-07-29 01:38:11,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:11,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:11,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:11,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1982663310, now seen corresponding path program 1 times [2020-07-29 01:38:11,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:11,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691643754] [2020-07-29 01:38:11,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:11,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:11,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:11,734 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:11,902 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2020-07-29 01:38:11,986 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:11,987 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:11,987 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:11,987 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:11,987 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:11,987 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:11,987 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:11,987 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:11,987 INFO L133 ssoRankerPreferences]: Filename of dumped script: array07_alloca.i_Iteration3_Lasso [2020-07-29 01:38:11,988 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:11,988 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:12,017 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:38:12,021 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:38:12,210 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:12,210 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:12,215 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:38:12,222 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:38:12,227 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:38:12,233 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:38:12,237 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:38:12,241 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:38:12,246 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:38:12,772 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:12,772 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:12,779 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:38:12,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:12,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:12,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:12,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:12,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:12,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:12,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:12,786 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:12,827 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:38:12,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:12,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:12,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:12,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:12,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:12,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:12,860 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:12,894 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:38:12,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:12,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:12,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:12,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:12,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:12,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:12,904 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 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:12,935 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:38:12,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:12,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:12,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:12,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:12,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:12,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:12,951 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:13,001 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:38:13,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:13,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:13,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,017 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:13,079 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:38:13,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:13,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:13,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:13,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,085 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:13,153 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:38:13,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:13,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:13,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,169 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:13,230 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:38:13,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:13,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:13,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:13,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,236 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 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,278 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:38:13,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:13,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:13,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:13,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:13,283 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 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,313 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:38:13,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:13,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:13,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:13,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:13,318 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 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,342 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:38:13,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:13,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:13,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:13,351 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:13,402 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:38:13,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,404 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:13,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:13,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:13,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:38:13,434 INFO L489 LassoAnalysis]: Using template '2-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,437 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:38:13,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:13,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,440 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:13,440 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:38:13,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:13,442 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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,468 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:38:13,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:13,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:13,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:13,471 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:38:13,490 INFO L401 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2020-07-29 01:38:13,490 INFO L402 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2020-07-29 01:38:13,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:13,742 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2020-07-29 01:38:13,742 INFO L444 ModelExtractionUtils]: 11 out of 51 variables were initially zero. Simplification set additionally 35 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:13,751 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:13,757 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 3. [2020-07-29 01:38:13,757 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:13,757 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 + 1*ULTIMATE.start_main_~length~0 f1 = -2*ULTIMATE.start_main_~j~0 + 2*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:38:13,800 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:38:13,804 INFO L393 LassoCheck]: Loop: "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_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210;" [2020-07-29 01:38:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:13,811 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:13,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:13,814 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:38:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:13,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:13,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:13,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {209#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {209#unseeded} is VALID [2020-07-29 01:38:13,866 INFO L280 TraceCheckUtils]: 1: Hoare triple {209#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_#t~post210, 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; {209#unseeded} is VALID [2020-07-29 01:38:13,867 INFO L280 TraceCheckUtils]: 2: Hoare triple {209#unseeded} assume !(main_~length~0 < 1); {209#unseeded} is VALID [2020-07-29 01:38:13,868 INFO L280 TraceCheckUtils]: 3: Hoare triple {209#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; {209#unseeded} is VALID [2020-07-29 01:38:13,868 INFO L280 TraceCheckUtils]: 4: Hoare triple {209#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {209#unseeded} is VALID [2020-07-29 01:38:13,869 INFO L280 TraceCheckUtils]: 5: Hoare triple {209#unseeded} 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; {209#unseeded} is VALID [2020-07-29 01:38:13,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {209#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {209#unseeded} is VALID [2020-07-29 01:38:13,870 INFO L280 TraceCheckUtils]: 7: Hoare triple {209#unseeded} assume !(main_~i~0 < main_~length~0); {209#unseeded} is VALID [2020-07-29 01:38:13,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {209#unseeded} main_~j~0 := 0; {209#unseeded} is VALID [2020-07-29 01:38:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:13,878 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:38:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:13,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:13,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {214#(and (>= oldRank0 (ite (> (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)) ULTIMATE.start_main_~length~0) 0) 1 0)) (>= oldRank1 (ite (> (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)) ULTIMATE.start_main_~length~0) 0) (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)) ULTIMATE.start_main_~length~0) (+ (* (- 2) ULTIMATE.start_main_~j~0) (* 2 ULTIMATE.start_main_~length~0)))))} 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_#t~post210 := main_#t~mem209;call write~int(main_#t~post210 - 1, main_~arr~0.base, main_~arr~0.offset, 4);main_~j~0 := main_~j~0 - main_#t~post210;havoc main_#t~mem209;havoc main_#t~post210; {243#(or (and (> oldRank0 (ite (> (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)) ULTIMATE.start_main_~length~0) 0) 1 0)) (>= oldRank0 0)) (and (>= oldRank1 0) (>= oldRank0 (ite (> (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)) ULTIMATE.start_main_~length~0) 0) 1 0)) (> oldRank1 (ite (> (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)) ULTIMATE.start_main_~length~0) 0) (+ (* 2 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)) ULTIMATE.start_main_~length~0) (+ (* (- 2) ULTIMATE.start_main_~j~0) (* 2 ULTIMATE.start_main_~length~0))))) unseeded)} is VALID [2020-07-29 01:38:13,888 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:38:13,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:38:13,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:13,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:13,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:38:13,900 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:38:13,929 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 2 states. [2020-07-29 01:38:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 01:38:13,929 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:13,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:13,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:13,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:13,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:38:13,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:13,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:13,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:13,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:38:13,932 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:38:13,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:38:13,934 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:13,935 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:13,935 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:38:13,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:38:13,937 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:13,937 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:13,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:13,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:38:13,938 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:38:13,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:13,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:38:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:38:13,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:38:13,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:38:13,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:38:13,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:38:13,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:13,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:13,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:38:13,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:13,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:13,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:13,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:13,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:13,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:13,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:38:13,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:38:13,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:38:13,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,949 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:38:13,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2020-07-29 01:38:13,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 1 letters. [2020-07-29 01:38:13,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:38:13,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:38:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:13,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:38:13,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:38:13,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-07-29 01:38:13,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:38:13,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:38:13,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:38:13,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:13,962 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:13,962 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:13,962 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:38:13,962 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:38:13,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:38:13,962 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:38:13,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:38:13,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:38:13 BoogieIcfgContainer [2020-07-29 01:38:13,974 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:38:13,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:38:13,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:38:13,975 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:38:13,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:08" (3/4) ... [2020-07-29 01:38:13,987 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:38:13,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:38:13,991 INFO L168 Benchmark]: Toolchain (without parser) took 6208.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 962.9 MB in the beginning and 875.0 MB in the end (delta: 87.9 MB). Peak memory consumption was 299.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:13,995 INFO L168 Benchmark]: CDTParser took 1.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:13,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:13,997 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:13,998 INFO L168 Benchmark]: Boogie Preprocessor took 25.71 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:38:13,999 INFO L168 Benchmark]: RCFGBuilder took 437.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:14,002 INFO L168 Benchmark]: BuchiAutomizer took 4981.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 875.0 MB in the end (delta: 210.8 MB). Peak memory consumption was 285.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:14,003 INFO L168 Benchmark]: Witness Printer took 13.41 ms. Allocated memory is still 1.2 GB. Free memory is still 875.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:14,007 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 1.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 666.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 437.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4981.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 875.0 MB in the end (delta: 210.8 MB). Peak memory consumption was 285.3 MB. Max. memory is 11.5 GB. * Witness Printer took 13.41 ms. Allocated memory is still 1.2 GB. Free memory is still 875.0 MB. 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). 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. One deterministic module has 2-nested ranking function (if 2 * unknown-#memory_int-unknown[arr][arr] + length > 0 then 1 else 0), (if 2 * unknown-#memory_int-unknown[arr][arr] + length > 0 then 2 * unknown-#memory_int-unknown[arr][arr] + length else -2 * j + 2 * length) and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 25 SDtfs, 29 SDslu, 11 SDs, 0 SdLazy, 30 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital113 mio100 ax100 hnf97 lsp94 ukn89 mio100 lsp70 div100 bol100 ite100 ukn100 eq179 hnf86 smp98 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 294ms VariablesStem: 10 VariablesLoop: 11 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 3 MotzkinApplications: 9 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...