./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.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-memory-alloca/count_down-alloca-2.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 9016787135830d25851d4a1126db5f65005e4eb5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:35:12,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:35:12,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:35:12,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:35:12,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:35:12,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:35:12,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:35:12,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:35:12,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:35:12,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:35:12,705 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:35:12,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:35:12,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:35:12,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:35:12,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:35:12,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:35:12,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:35:12,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:35:12,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:35:12,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:35:12,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:35:12,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:35:12,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:35:12,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:35:12,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:35:12,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:35:12,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:35:12,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:35:12,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:35:12,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:35:12,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:35:12,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:35:12,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:35:12,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:35:12,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:35:12,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:35:12,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:35:12,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:35:12,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:35:12,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:35:12,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:35:12,741 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:35:12,758 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:35:12,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:35:12,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:35:12,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:35:12,761 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:35:12,761 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:35:12,761 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:35:12,762 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:35:12,762 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:35:12,762 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:35:12,762 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:35:12,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:35:12,763 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:35:12,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:35:12,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:35:12,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:35:12,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:35:12,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:35:12,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:35:12,765 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:35:12,765 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:35:12,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:35:12,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:35:12,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:35:12,766 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:35:12,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:35:12,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:35:12,767 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:35:12,768 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:35:12,769 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:35:12,769 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 -> 9016787135830d25851d4a1126db5f65005e4eb5 [2020-07-29 01:35:13,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:35:13,091 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:35:13,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:35:13,097 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:35:13,097 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:35:13,098 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2020-07-29 01:35:13,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b40f2ce/291d92dddbd04b0885848e8806566787/FLAGae66153c7 [2020-07-29 01:35:13,637 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:35:13,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/count_down-alloca-2.i [2020-07-29 01:35:13,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b40f2ce/291d92dddbd04b0885848e8806566787/FLAGae66153c7 [2020-07-29 01:35:13,931 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47b40f2ce/291d92dddbd04b0885848e8806566787 [2020-07-29 01:35:13,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:35:13,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:35:13,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:13,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:35:13,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:35:13,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cfd59b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:13, skipping insertion in model container [2020-07-29 01:35:13,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:13" (1/1) ... [2020-07-29 01:35:13,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:35:13,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:35:14,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:14,301 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:35:14,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:14,467 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:35:14,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14 WrapperNode [2020-07-29 01:35:14,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:14,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:14,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:35:14,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:35:14,478 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:35:14" (1/1) ... [2020-07-29 01:35:14,494 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:35:14" (1/1) ... [2020-07-29 01:35:14,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:14,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:35:14,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:35:14,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:35:14,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (1/1) ... [2020-07-29 01:35:14,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (1/1) ... [2020-07-29 01:35:14,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (1/1) ... [2020-07-29 01:35:14,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (1/1) ... [2020-07-29 01:35:14,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (1/1) ... [2020-07-29 01:35:14,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (1/1) ... [2020-07-29 01:35:14,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (1/1) ... [2020-07-29 01:35:14,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:35:14,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:35:14,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:35:14,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:35:14,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (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:35:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:35:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:35:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:35:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:35:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:35:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:35:15,084 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:35:15,085 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:35:15,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:15 BoogieIcfgContainer [2020-07-29 01:35:15,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:35:15,090 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:35:15,090 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:35:15,094 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:35:15,095 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:15,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:35:13" (1/3) ... [2020-07-29 01:35:15,097 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20e7abf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:15, skipping insertion in model container [2020-07-29 01:35:15,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:15,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:14" (2/3) ... [2020-07-29 01:35:15,098 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20e7abf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:15, skipping insertion in model container [2020-07-29 01:35:15,098 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:15,098 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:15" (3/3) ... [2020-07-29 01:35:15,100 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-2.i [2020-07-29 01:35:15,156 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:35:15,157 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:35:15,157 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:35:15,157 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:35:15,157 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:35:15,158 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:35:15,158 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:35:15,158 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:35:15,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:35:15,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:35:15,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:15,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:15,211 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:15,211 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:15,212 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:35:15,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:35:15,216 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:35:15,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:15,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:15,217 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:35:15,217 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:15,226 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 12#L551true assume !(main_~length~0 < 1); 18#L551-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 9#L553true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 13#L554-3true [2020-07-29 01:35:15,227 INFO L796 eck$LassoCheckResult]: Loop: 13#L554-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 5#L556true assume main_~val~0 < 0;main_~val~0 := 0; 7#L556-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 11#L554-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13#L554-3true [2020-07-29 01:35:15,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:15,234 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:35:15,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:15,246 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700627978] [2020-07-29 01:35:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:15,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:15,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:15,391 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:15,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:15,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2020-07-29 01:35:15,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:15,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926565376] [2020-07-29 01:35:15,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:15,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:15,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:15,420 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:15,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2020-07-29 01:35:15,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:15,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118745780] [2020-07-29 01:35:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:15,448 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:15,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:15,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:15,708 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2020-07-29 01:35:15,886 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:15,887 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:15,887 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:15,888 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:15,888 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:15,888 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:15,888 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:15,889 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:15,889 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration1_Lasso [2020-07-29 01:35:15,889 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:15,890 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:15,952 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:35:16,111 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:35:16,116 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:35:16,121 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:35:16,126 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:35:16,131 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:35:16,137 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:35:16,143 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:35:16,149 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:35:16,153 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:35:16,158 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:35:16,167 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:35:16,173 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:35:16,178 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:35:16,183 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:35:16,780 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:16,786 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:35:16,795 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:35:16,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:16,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:16,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:16,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:16,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:16,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:16,802 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:35:16,814 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:16,851 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:35:16,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:16,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:16,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:16,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:16,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:16,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:16,873 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:35:16,917 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:35:16,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:16,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:16,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:16,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:16,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:16,934 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:35:16,945 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:35:16,986 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:35:16,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:16,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:16,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:16,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:17,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:17,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:17,032 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:17,078 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-07-29 01:35:17,078 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:17,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:17,089 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:17,089 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:17,090 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:35:17,144 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:35:17,149 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5;" "assume main_~val~0 < 0;main_~val~0 := 0;" "call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);" "main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4;" [2020-07-29 01:35:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:17,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:17,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:17,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:17,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2020-07-29 01:35:17,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {28#unseeded} is VALID [2020-07-29 01:35:17,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~length~0 < 1); {28#unseeded} is VALID [2020-07-29 01:35:17,237 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#unseeded} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {28#unseeded} is VALID [2020-07-29 01:35:17,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {28#unseeded} is VALID [2020-07-29 01:35:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:17,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:35:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:17,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:17,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:35:17,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} assume main_~val~0 < 0;main_~val~0 := 0; {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:35:17,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:35:17,280 INFO L280 TraceCheckUtils]: 3: Hoare triple {73#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {56#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:35:17,280 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:35:17,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:17,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:17,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:17,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,315 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:35:17,316 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-07-29 01:35:17,484 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2020-07-29 01:35:17,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:17,485 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:17,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:35:17,491 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:35:17,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:17,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:17,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:17,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:35:17,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:17,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:17,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 60 transitions. [2020-07-29 01:35:17,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:17,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:17,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:17,518 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states. [2020-07-29 01:35:17,529 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:35:17,532 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:35:17,533 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:17,536 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:35:17,538 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:17,538 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 60 transitions. cyclomatic complexity: 21 [2020-07-29 01:35:17,540 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:35:17,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:17,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:17,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:17,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:17,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:17,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:17,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:35:17,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:35:17,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:35:17,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:17,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:17,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:17,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:17,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:17,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:35:17,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:17,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:17,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:17,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:17,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:17,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:35:17,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:17,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:17,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:35:17,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:17,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:17,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:17,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:35:17,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:35:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:35:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:17,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:17,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:35:17,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:17,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:17,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:17,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:35:17,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:35:17,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:35:17,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:17,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:17,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:17,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:17,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:17,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:35:17,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:17,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:17,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:35:17,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:35:17,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:17,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:17,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 60 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:35:17,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,595 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2020-07-29 01:35:17,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:35:17,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:35:17,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:35:17,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:17,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. cyclomatic complexity: 21 [2020-07-29 01:35:17,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:17,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2020-07-29 01:35:17,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:35:17,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:35:17,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-29 01:35:17,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:17,637 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:35:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-29 01:35:17,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 01:35:17,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:17,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 01:35:17,673 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 01:35:17,676 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 01:35:17,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:17,682 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:35:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:35:17,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:17,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:17,684 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 01:35:17,684 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 01:35:17,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:17,686 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:35:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:35:17,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:17,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:17,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:17,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:35:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 01:35:17,692 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:35:17,692 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 01:35:17,692 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:35:17,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:35:17,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:17,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:17,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:17,694 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:17,694 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:17,694 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 141#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 142#L551 assume !(main_~length~0 < 1); 147#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 143#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 144#L554-3 assume !(main_~i~0 < main_~length~0); 148#L554-4 main_~j~0 := 0; 136#L561-3 [2020-07-29 01:35:17,696 INFO L796 eck$LassoCheckResult]: Loop: 136#L561-3 assume !!(main_~j~0 < main_~length~0); 137#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 149#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 150#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 136#L561-3 [2020-07-29 01:35:17,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:17,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2020-07-29 01:35:17,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:17,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595313488] [2020-07-29 01:35:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:17,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {184#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {184#true} is VALID [2020-07-29 01:35:17,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {184#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {184#true} is VALID [2020-07-29 01:35:17,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {184#true} assume !(main_~length~0 < 1); {186#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:35:17,827 INFO L280 TraceCheckUtils]: 3: Hoare triple {186#(<= 1 ULTIMATE.start_main_~length~0)} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {186#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:35:17,828 INFO L280 TraceCheckUtils]: 4: Hoare triple {186#(<= 1 ULTIMATE.start_main_~length~0)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {187#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:35:17,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {187#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} assume !(main_~i~0 < main_~length~0); {185#false} is VALID [2020-07-29 01:35:17,829 INFO L280 TraceCheckUtils]: 6: Hoare triple {185#false} main_~j~0 := 0; {185#false} is VALID [2020-07-29 01:35:17,831 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:35:17,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595313488] [2020-07-29 01:35:17,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:17,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:35:17,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020518093] [2020-07-29 01:35:17,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:17,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:17,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2020-07-29 01:35:17,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:17,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514615390] [2020-07-29 01:35:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:17,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:17,890 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:17,906 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:17,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:17,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:35:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:35:17,964 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:35:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:18,050 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:35:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:35:18,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:35:18,059 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:35:18,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:35:18,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:18,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2020-07-29 01:35:18,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:35:18,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:35:18,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2020-07-29 01:35:18,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:18,065 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 01:35:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2020-07-29 01:35:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2020-07-29 01:35:18,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:18,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 23 transitions. Second operand 15 states. [2020-07-29 01:35:18,067 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 23 transitions. Second operand 15 states. [2020-07-29 01:35:18,067 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand 15 states. [2020-07-29 01:35:18,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:18,068 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:35:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2020-07-29 01:35:18,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:18,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:18,069 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 18 states and 23 transitions. [2020-07-29 01:35:18,069 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 18 states and 23 transitions. [2020-07-29 01:35:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:18,070 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:35:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2020-07-29 01:35:18,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:18,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:18,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:18,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:35:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-07-29 01:35:18,073 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 01:35:18,073 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 01:35:18,073 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:35:18,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:35:18,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:35:18,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:18,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:18,077 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:18,077 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:35:18,077 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 213#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 214#L551 assume !(main_~length~0 < 1); 219#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 215#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 216#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 210#L556 assume !(main_~val~0 < 0); 211#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 212#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 218#L554-3 assume !(main_~i~0 < main_~length~0); 220#L554-4 main_~j~0 := 0; 208#L561-3 [2020-07-29 01:35:18,078 INFO L796 eck$LassoCheckResult]: Loop: 208#L561-3 assume !!(main_~j~0 < main_~length~0); 209#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 221#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 222#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 208#L561-3 [2020-07-29 01:35:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:18,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2020-07-29 01:35:18,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:18,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8893444] [2020-07-29 01:35:18,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,131 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:18,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2020-07-29 01:35:18,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:18,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091760797] [2020-07-29 01:35:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,139 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,145 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:18,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:18,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2020-07-29 01:35:18,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:18,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900283133] [2020-07-29 01:35:18,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:18,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:18,183 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:18,360 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2020-07-29 01:35:18,427 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:18,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:18,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:18,428 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:18,428 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:18,428 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:18,428 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:18,428 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:18,428 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration3_Lasso [2020-07-29 01:35:18,428 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:18,428 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:18,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:18,452 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:35:18,456 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:35:18,604 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:35:18,607 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:35:18,612 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:35:18,616 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:35:18,620 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:35:18,623 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:35:18,627 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:35:18,630 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:35:18,633 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:35:18,637 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:35:18,643 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:35:19,219 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:19,219 INFO L489 LassoAnalysis]: Using template 'affine'. 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:35:19,234 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:35:19,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:19,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:19,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:19,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:19,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:19,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:19,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:19,239 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 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:35:19,270 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:35:19,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:19,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:19,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:19,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:19,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:19,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:19,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:19,275 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:35:19,298 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:35:19,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:19,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:19,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:19,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:19,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:19,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:19,310 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:19,333 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:35:19,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:19,335 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:19,335 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:19,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:19,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:19,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:19,365 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:19,584 INFO L443 ModelExtractionUtils]: Simplification made 27 calls to the SMT solver. [2020-07-29 01:35:19,584 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 20 variables to zero. 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:35:19,586 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:19,589 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:19,589 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:19,589 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:35:19,622 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:35:19,626 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < main_~length~0);" "call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !(main_#t~mem7 > 0);havoc main_#t~mem7;" "main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6;" [2020-07-29 01:35:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:19,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:19,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:19,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:19,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {268#unseeded} is VALID [2020-07-29 01:35:19,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {268#unseeded} is VALID [2020-07-29 01:35:19,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {268#unseeded} assume !(main_~length~0 < 1); {268#unseeded} is VALID [2020-07-29 01:35:19,673 INFO L280 TraceCheckUtils]: 3: Hoare triple {268#unseeded} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {268#unseeded} is VALID [2020-07-29 01:35:19,674 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {268#unseeded} is VALID [2020-07-29 01:35:19,675 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {268#unseeded} is VALID [2020-07-29 01:35:19,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#unseeded} assume !(main_~val~0 < 0); {268#unseeded} is VALID [2020-07-29 01:35:19,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {268#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {268#unseeded} is VALID [2020-07-29 01:35:19,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {268#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {268#unseeded} is VALID [2020-07-29 01:35:19,678 INFO L280 TraceCheckUtils]: 9: Hoare triple {268#unseeded} assume !(main_~i~0 < main_~length~0); {268#unseeded} is VALID [2020-07-29 01:35:19,679 INFO L280 TraceCheckUtils]: 10: Hoare triple {268#unseeded} main_~j~0 := 0; {268#unseeded} is VALID [2020-07-29 01:35:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:19,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:35:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:19,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:19,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))} assume !!(main_~j~0 < main_~length~0); {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:35:19,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:35:19,714 INFO L280 TraceCheckUtils]: 2: Hoare triple {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} assume !(main_#t~mem7 > 0);havoc main_#t~mem7; {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:35:19,716 INFO L280 TraceCheckUtils]: 3: Hoare triple {331#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; {296#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:35:19,716 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:35:19,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:19,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:19,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:19,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,733 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:35:19,733 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:35:19,783 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 4 states. [2020-07-29 01:35:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:19,784 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:19,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:19,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:19,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:19,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:19,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:19,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:19,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:19,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:35:19,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:19,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:19,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:19,790 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2020-07-29 01:35:19,791 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:35:19,792 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:19,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:19,793 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:19,793 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:19,796 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:19,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:19,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:19,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:19,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:19,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:19,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:19,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:19,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:19,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:35:19,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:19,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:19,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:35:19,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:19,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:19,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:35:19,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:19,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:19,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:19,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:19,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:19,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:19,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:19,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:19,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:35:19,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:19,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:19,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:19,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:19,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:35:19,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:35:19,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:35:19,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,813 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:35:19,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:35:19,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:35:19,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:35:19,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:19,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:19,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:19,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2020-07-29 01:35:19,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:35:19,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:35:19,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2020-07-29 01:35:19,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:19,824 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 01:35:19,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2020-07-29 01:35:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 01:35:19,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:19,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 25 transitions. Second operand 18 states. [2020-07-29 01:35:19,827 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 25 transitions. Second operand 18 states. [2020-07-29 01:35:19,828 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand 18 states. [2020-07-29 01:35:19,828 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:19,832 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2020-07-29 01:35:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:35:19,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:19,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:19,833 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 25 transitions. [2020-07-29 01:35:19,833 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 25 transitions. [2020-07-29 01:35:19,834 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:19,835 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-07-29 01:35:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:35:19,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:19,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:19,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:19,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:19,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:35:19,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-07-29 01:35:19,837 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-29 01:35:19,837 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-29 01:35:19,837 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:35:19,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:35:19,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:19,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:19,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:19,838 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:19,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:19,839 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 374#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 375#L551 assume !(main_~length~0 < 1); 380#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 376#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 377#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 371#L556 assume !(main_~val~0 < 0); 372#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 373#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 379#L554-3 assume !(main_~i~0 < main_~length~0); 381#L554-4 main_~j~0 := 0; 367#L561-3 assume !!(main_~j~0 < main_~length~0); 369#L562-3 [2020-07-29 01:35:19,839 INFO L796 eck$LassoCheckResult]: Loop: 369#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 382#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 369#L562-3 [2020-07-29 01:35:19,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:19,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1720311820, now seen corresponding path program 1 times [2020-07-29 01:35:19,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:19,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246026293] [2020-07-29 01:35:19,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:19,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:19,861 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:19,864 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:19,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:19,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2020-07-29 01:35:19,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:19,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102215749] [2020-07-29 01:35:19,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:19,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:19,875 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:19,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:19,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:19,877 INFO L82 PathProgramCache]: Analyzing trace with hash -342748399, now seen corresponding path program 1 times [2020-07-29 01:35:19,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:19,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293704408] [2020-07-29 01:35:19,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:19,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:19,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:19,909 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:20,076 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2020-07-29 01:35:20,148 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:20,148 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:20,148 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:20,148 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:20,148 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:20,149 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:20,149 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:20,149 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:20,149 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration4_Lasso [2020-07-29 01:35:20,149 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:20,149 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:20,181 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:35:20,185 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:35:20,189 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:35:20,194 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:35:20,198 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:35:20,203 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:35:20,207 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:35:20,404 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:35:20,409 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:35:20,412 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:35:20,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:20,420 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:35:20,424 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:35:20,428 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:35:21,063 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:21,063 INFO L489 LassoAnalysis]: Using template 'affine'. 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:35:21,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:35:21,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:21,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:21,082 INFO L402 nArgumentSynthesizer]: A total of 0 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:35:21,084 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:35:21,128 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:35:21,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:21,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,134 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:21,134 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:35:21,136 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:35:21,179 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:35:21,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,182 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:35:21,188 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,236 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:35:21,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:21,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,238 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:21,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:21,240 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:35:21,280 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:35:21,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,290 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:35:21,318 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:35:21,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:21,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:21,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:21,322 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:35:21,350 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:35:21,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:21,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:21,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:21,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:21,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:21,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:21,365 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:21,379 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:35:21,380 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. 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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:21,382 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:21,384 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:35:21,385 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:21,385 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))_1 Supporting invariants [] [2020-07-29 01:35:21,423 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:35:21,427 INFO L393 LassoCheck]: Loop: "call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8;" [2020-07-29 01:35:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:21,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:21,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:21,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:35:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:21,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:21,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {494#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {494#unseeded} is VALID [2020-07-29 01:35:21,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {494#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {494#unseeded} is VALID [2020-07-29 01:35:21,556 INFO L280 TraceCheckUtils]: 2: Hoare triple {494#unseeded} assume !(main_~length~0 < 1); {494#unseeded} is VALID [2020-07-29 01:35:21,557 INFO L280 TraceCheckUtils]: 3: Hoare triple {494#unseeded} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {494#unseeded} is VALID [2020-07-29 01:35:21,558 INFO L280 TraceCheckUtils]: 4: Hoare triple {494#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:35:21,558 INFO L280 TraceCheckUtils]: 5: Hoare triple {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:35:21,559 INFO L280 TraceCheckUtils]: 6: Hoare triple {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} assume !(main_~val~0 < 0); {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:35:21,561 INFO L280 TraceCheckUtils]: 7: Hoare triple {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:35:21,562 INFO L280 TraceCheckUtils]: 8: Hoare triple {549#(and (= 0 ULTIMATE.start_main_~i~0) unseeded)} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {562#(and (= 1 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:35:21,563 INFO L280 TraceCheckUtils]: 9: Hoare triple {562#(and (= 1 ULTIMATE.start_main_~i~0) unseeded)} assume !(main_~i~0 < main_~length~0); {562#(and (= 1 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:35:21,563 INFO L280 TraceCheckUtils]: 10: Hoare triple {562#(and (= 1 ULTIMATE.start_main_~i~0) unseeded)} main_~j~0 := 0; {569#(and (= 0 ULTIMATE.start_main_~j~0) (= 1 ULTIMATE.start_main_~i~0) unseeded)} is VALID [2020-07-29 01:35:21,564 INFO L280 TraceCheckUtils]: 11: Hoare triple {569#(and (= 0 ULTIMATE.start_main_~j~0) (= 1 ULTIMATE.start_main_~i~0) unseeded)} assume !!(main_~j~0 < main_~length~0); {528#(and unseeded (= (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} is VALID [2020-07-29 01:35:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:21,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:35:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:21,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:21,617 INFO L280 TraceCheckUtils]: 0: Hoare triple {529#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))) (= (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {573#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4))) oldRank0) (= (* 4 ULTIMATE.start_main_~i~0) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} is VALID [2020-07-29 01:35:21,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {573#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4))) oldRank0) (= (* 4 ULTIMATE.start_main_~i~0) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; {531#(and (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)))) (>= oldRank0 0)) unseeded) (= (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~i~0 4) (- 4)) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} is VALID [2020-07-29 01:35:21,619 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:35:21,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:35:21,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:21,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:21,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,639 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 01:35:21,640 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-07-29 01:35:21,835 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 39 states and 51 transitions. Complement of second has 11 states. [2020-07-29 01:35:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 01:35:21,835 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:21,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:21,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:35:21,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:21,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 51 transitions. [2020-07-29 01:35:21,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:21,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,839 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:21,839 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:21,839 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:35:21,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:21,841 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:21,841 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 51 transitions. cyclomatic complexity: 17 [2020-07-29 01:35:21,842 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:21,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:21,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:21,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:21,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:21,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:21,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:21,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:21,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:21,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:21,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:35:21,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:35:21,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 39 letters. Loop has 39 letters. [2020-07-29 01:35:21,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:21,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:21,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:35:21,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:21,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:21,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:35:21,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:21,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:21,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:21,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:21,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:21,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:35:21,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:21,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:21,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:35:21,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:21,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:21,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:21,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:21,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:21,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 51 transitions. cyclomatic complexity: 17 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:21,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,850 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:21,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:35:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2020-07-29 01:35:21,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:35:21,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:35:21,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 30 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:35:21,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:21,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. cyclomatic complexity: 17 [2020-07-29 01:35:21,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:21,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 44 transitions. [2020-07-29 01:35:21,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:35:21,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:35:21,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2020-07-29 01:35:21,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:21,856 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-29 01:35:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2020-07-29 01:35:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-07-29 01:35:21,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:21,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 44 transitions. Second operand 27 states. [2020-07-29 01:35:21,859 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 44 transitions. Second operand 27 states. [2020-07-29 01:35:21,859 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 27 states. [2020-07-29 01:35:21,860 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:21,862 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-29 01:35:21,862 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-29 01:35:21,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:21,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:21,862 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 34 states and 44 transitions. [2020-07-29 01:35:21,862 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 34 states and 44 transitions. [2020-07-29 01:35:21,863 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:21,866 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-07-29 01:35:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2020-07-29 01:35:21,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:21,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:21,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:21,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:35:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-07-29 01:35:21,868 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-29 01:35:21,868 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-07-29 01:35:21,868 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:35:21,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2020-07-29 01:35:21,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:21,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:21,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:21,869 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:21,869 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:21,870 INFO L794 eck$LassoCheckResult]: Stem: 650#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 646#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 647#L551 assume !(main_~length~0 < 1); 652#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 648#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 649#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 653#L556 assume !(main_~val~0 < 0); 664#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 663#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 654#L554-3 assume !(main_~i~0 < main_~length~0); 655#L554-4 main_~j~0 := 0; 638#L561-3 assume !!(main_~j~0 < main_~length~0); 639#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 662#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 659#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 640#L561-3 assume !!(main_~j~0 < main_~length~0); 642#L562-3 [2020-07-29 01:35:21,870 INFO L796 eck$LassoCheckResult]: Loop: 642#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 656#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 642#L562-3 [2020-07-29 01:35:21,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:21,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2020-07-29 01:35:21,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:21,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939821531] [2020-07-29 01:35:21,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:21,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {827#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {827#true} is VALID [2020-07-29 01:35:21,948 INFO L280 TraceCheckUtils]: 1: Hoare triple {827#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {827#true} is VALID [2020-07-29 01:35:21,949 INFO L280 TraceCheckUtils]: 2: Hoare triple {827#true} assume !(main_~length~0 < 1); {827#true} is VALID [2020-07-29 01:35:21,950 INFO L280 TraceCheckUtils]: 3: Hoare triple {827#true} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {827#true} is VALID [2020-07-29 01:35:21,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {827#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {829#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:35:21,951 INFO L280 TraceCheckUtils]: 5: Hoare triple {829#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {829#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:35:21,952 INFO L280 TraceCheckUtils]: 6: Hoare triple {829#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~val~0 < 0); {829#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:35:21,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {829#(= 0 ULTIMATE.start_main_~i~0)} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {829#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:35:21,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {829#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {830#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:35:21,957 INFO L280 TraceCheckUtils]: 9: Hoare triple {830#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < main_~length~0); {831#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:35:21,957 INFO L280 TraceCheckUtils]: 10: Hoare triple {831#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:21,958 INFO L280 TraceCheckUtils]: 11: Hoare triple {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:21,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:21,959 INFO L280 TraceCheckUtils]: 13: Hoare triple {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem7 > 0);havoc main_#t~mem7; {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:21,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {832#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; {833#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:35:21,961 INFO L280 TraceCheckUtils]: 15: Hoare triple {833#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < main_~length~0); {828#false} is VALID [2020-07-29 01:35:21,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:21,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939821531] [2020-07-29 01:35:21,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701817399] [2020-07-29 01:35:21,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:35:22,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:35:22,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:35:22,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:35:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:22,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {827#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {827#true} is VALID [2020-07-29 01:35:22,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {827#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {827#true} is VALID [2020-07-29 01:35:22,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {827#true} assume !(main_~length~0 < 1); {827#true} is VALID [2020-07-29 01:35:22,166 INFO L280 TraceCheckUtils]: 3: Hoare triple {827#true} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {827#true} is VALID [2020-07-29 01:35:22,167 INFO L280 TraceCheckUtils]: 4: Hoare triple {827#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {849#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:35:22,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {849#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {849#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:35:22,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {849#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_~val~0 < 0); {849#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:35:22,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {849#(<= ULTIMATE.start_main_~i~0 0)} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {849#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:35:22,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {849#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {830#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:35:22,171 INFO L280 TraceCheckUtils]: 9: Hoare triple {830#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < main_~length~0); {831#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:35:22,172 INFO L280 TraceCheckUtils]: 10: Hoare triple {831#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:22,174 INFO L280 TraceCheckUtils]: 11: Hoare triple {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:22,175 INFO L280 TraceCheckUtils]: 12: Hoare triple {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:22,175 INFO L280 TraceCheckUtils]: 13: Hoare triple {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem7 > 0);havoc main_#t~mem7; {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:22,177 INFO L280 TraceCheckUtils]: 14: Hoare triple {868#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; {881#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:35:22,178 INFO L280 TraceCheckUtils]: 15: Hoare triple {881#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {828#false} is VALID [2020-07-29 01:35:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:22,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:35:22,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 01:35:22,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887784040] [2020-07-29 01:35:22,180 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:22,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2020-07-29 01:35:22,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:22,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684520040] [2020-07-29 01:35:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:22,196 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:22,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,210 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:22,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:22,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:35:22,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:35:22,263 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. cyclomatic complexity: 13 Second operand 10 states. [2020-07-29 01:35:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:22,578 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2020-07-29 01:35:22,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:35:22,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:35:22,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:22,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2020-07-29 01:35:22,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:35:22,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 40 states and 51 transitions. [2020-07-29 01:35:22,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:35:22,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:35:22,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 51 transitions. [2020-07-29 01:35:22,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:22,628 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2020-07-29 01:35:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 51 transitions. [2020-07-29 01:35:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2020-07-29 01:35:22,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:22,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states and 51 transitions. Second operand 35 states. [2020-07-29 01:35:22,635 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states and 51 transitions. Second operand 35 states. [2020-07-29 01:35:22,636 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 35 states. [2020-07-29 01:35:22,637 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:22,644 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-29 01:35:22,644 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-29 01:35:22,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:22,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:22,645 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 40 states and 51 transitions. [2020-07-29 01:35:22,645 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 40 states and 51 transitions. [2020-07-29 01:35:22,646 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:22,649 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-29 01:35:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2020-07-29 01:35:22,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:22,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:22,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:22,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:22,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 01:35:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-07-29 01:35:22,651 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-29 01:35:22,651 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-29 01:35:22,651 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:35:22,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-07-29 01:35:22,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:22,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:22,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:22,653 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:22,653 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:22,653 INFO L794 eck$LassoCheckResult]: Stem: 954#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 950#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 951#L551 assume main_~length~0 < 1;main_~length~0 := 1; 957#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 976#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 975#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 974#L556 assume !(main_~val~0 < 0); 973#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 972#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 971#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 966#L556 assume !(main_~val~0 < 0); 969#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 967#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 965#L554-3 assume !(main_~i~0 < main_~length~0); 962#L554-4 main_~j~0 := 0; 943#L561-3 assume !!(main_~j~0 < main_~length~0); 944#L562-3 [2020-07-29 01:35:22,653 INFO L796 eck$LassoCheckResult]: Loop: 944#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 959#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 944#L562-3 [2020-07-29 01:35:22,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:22,653 INFO L82 PathProgramCache]: Analyzing trace with hash -420071865, now seen corresponding path program 1 times [2020-07-29 01:35:22,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:22,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591536627] [2020-07-29 01:35:22,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1202#true} is VALID [2020-07-29 01:35:22,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1202#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {1202#true} is VALID [2020-07-29 01:35:22,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {1202#true} assume main_~length~0 < 1;main_~length~0 := 1; {1204#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:35:22,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {1204#(<= ULTIMATE.start_main_~length~0 1)} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {1204#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:35:22,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {1204#(<= ULTIMATE.start_main_~length~0 1)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} assume !(main_~val~0 < 0); {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {1205#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~i~0))} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1206#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:35:22,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {1206#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1203#false} is VALID [2020-07-29 01:35:22,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {1203#false} assume !(main_~val~0 < 0); {1203#false} is VALID [2020-07-29 01:35:22,714 INFO L280 TraceCheckUtils]: 11: Hoare triple {1203#false} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1203#false} is VALID [2020-07-29 01:35:22,715 INFO L280 TraceCheckUtils]: 12: Hoare triple {1203#false} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1203#false} is VALID [2020-07-29 01:35:22,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {1203#false} assume !(main_~i~0 < main_~length~0); {1203#false} is VALID [2020-07-29 01:35:22,715 INFO L280 TraceCheckUtils]: 14: Hoare triple {1203#false} main_~j~0 := 0; {1203#false} is VALID [2020-07-29 01:35:22,715 INFO L280 TraceCheckUtils]: 15: Hoare triple {1203#false} assume !!(main_~j~0 < main_~length~0); {1203#false} is VALID [2020-07-29 01:35:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:22,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591536627] [2020-07-29 01:35:22,717 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931526486] [2020-07-29 01:35:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:35:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:35:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:22,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:22,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {1202#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1202#true} is VALID [2020-07-29 01:35:22,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {1202#true} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {1202#true} is VALID [2020-07-29 01:35:22,871 INFO L280 TraceCheckUtils]: 2: Hoare triple {1202#true} assume main_~length~0 < 1;main_~length~0 := 1; {1204#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:35:22,871 INFO L280 TraceCheckUtils]: 3: Hoare triple {1204#(<= ULTIMATE.start_main_~length~0 1)} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {1204#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:35:22,872 INFO L280 TraceCheckUtils]: 4: Hoare triple {1204#(<= ULTIMATE.start_main_~length~0 1)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,873 INFO L280 TraceCheckUtils]: 6: Hoare triple {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} assume !(main_~val~0 < 0); {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,873 INFO L280 TraceCheckUtils]: 7: Hoare triple {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,874 INFO L280 TraceCheckUtils]: 8: Hoare triple {1222#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~i~0))} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1235#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:35:22,875 INFO L280 TraceCheckUtils]: 9: Hoare triple {1235#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1203#false} is VALID [2020-07-29 01:35:22,876 INFO L280 TraceCheckUtils]: 10: Hoare triple {1203#false} assume !(main_~val~0 < 0); {1203#false} is VALID [2020-07-29 01:35:22,876 INFO L280 TraceCheckUtils]: 11: Hoare triple {1203#false} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1203#false} is VALID [2020-07-29 01:35:22,876 INFO L280 TraceCheckUtils]: 12: Hoare triple {1203#false} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1203#false} is VALID [2020-07-29 01:35:22,876 INFO L280 TraceCheckUtils]: 13: Hoare triple {1203#false} assume !(main_~i~0 < main_~length~0); {1203#false} is VALID [2020-07-29 01:35:22,877 INFO L280 TraceCheckUtils]: 14: Hoare triple {1203#false} main_~j~0 := 0; {1203#false} is VALID [2020-07-29 01:35:22,877 INFO L280 TraceCheckUtils]: 15: Hoare triple {1203#false} assume !!(main_~j~0 < main_~length~0); {1203#false} is VALID [2020-07-29 01:35:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:22,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:35:22,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2020-07-29 01:35:22,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867823430] [2020-07-29 01:35:22,878 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:35:22,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2020-07-29 01:35:22,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:22,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507771906] [2020-07-29 01:35:22,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:22,884 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:22,887 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:22,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:22,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:35:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:35:22,923 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2020-07-29 01:35:23,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:23,003 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 01:35:23,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:35:23,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:35:23,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:23,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2020-07-29 01:35:23,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:23,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 22 states and 28 transitions. [2020-07-29 01:35:23,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:35:23,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:35:23,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 28 transitions. [2020-07-29 01:35:23,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:23,029 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 01:35:23,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 28 transitions. [2020-07-29 01:35:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-29 01:35:23,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:23,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 28 transitions. Second operand 22 states. [2020-07-29 01:35:23,031 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 28 transitions. Second operand 22 states. [2020-07-29 01:35:23,031 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 22 states. [2020-07-29 01:35:23,032 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:23,033 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:35:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:35:23,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:23,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:23,033 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states and 28 transitions. [2020-07-29 01:35:23,034 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states and 28 transitions. [2020-07-29 01:35:23,034 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:23,036 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 01:35:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:35:23,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:23,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:23,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:23,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:35:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-07-29 01:35:23,037 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 01:35:23,037 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 01:35:23,037 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:35:23,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-07-29 01:35:23,038 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:23,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:23,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:23,038 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:23,039 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:23,039 INFO L794 eck$LassoCheckResult]: Stem: 1296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1292#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 1293#L551 assume !(main_~length~0 < 1); 1298#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1294#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1295#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 1289#L556 assume !(main_~val~0 < 0); 1290#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1291#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1297#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 1299#L556 assume !(main_~val~0 < 0); 1306#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1305#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1304#L554-3 assume !(main_~i~0 < main_~length~0); 1303#L554-4 main_~j~0 := 0; 1285#L561-3 assume !!(main_~j~0 < main_~length~0); 1286#L562-3 [2020-07-29 01:35:23,039 INFO L796 eck$LassoCheckResult]: Loop: 1286#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1300#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 1286#L562-3 [2020-07-29 01:35:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1431189115, now seen corresponding path program 2 times [2020-07-29 01:35:23,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:23,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252602791] [2020-07-29 01:35:23,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,061 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,065 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:23,065 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 4 times [2020-07-29 01:35:23,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:23,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015054616] [2020-07-29 01:35:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,070 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:23,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:23,075 INFO L82 PathProgramCache]: Analyzing trace with hash -983203254, now seen corresponding path program 2 times [2020-07-29 01:35:23,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:23,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195399513] [2020-07-29 01:35:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:23,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:23,109 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:23,370 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2020-07-29 01:35:23,515 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:23,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:23,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:23,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:23,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:23,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:23,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:23,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:23,517 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration7_Lasso [2020-07-29 01:35:23,517 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:23,517 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:23,539 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:35:23,548 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:35:23,552 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:35:23,557 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:35:23,562 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:35:23,567 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:35:23,572 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:35:23,575 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:35:23,587 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:35:23,592 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:35:23,595 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:35:23,599 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:35:23,604 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:35:23,609 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:35:23,613 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:35:23,767 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:35:23,767 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:35:24,293 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:24,295 INFO L489 LassoAnalysis]: Using template 'affine'. 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:35:24,298 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:35:24,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,300 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,301 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,303 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 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,327 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:35:24,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,331 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 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,355 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:35:24,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,361 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,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:35:24,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,391 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 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,413 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:35:24,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,419 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 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,443 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:35:24,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,455 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:24,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:35:24,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:24,533 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:35:24,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,551 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 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,574 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:35:24,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,577 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,601 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:35:24,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,604 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,626 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:35:24,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,630 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 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,654 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:35:24,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,662 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 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,692 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:35:24,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,703 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 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,726 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:35:24,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,729 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,730 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 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,752 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:35:24,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,755 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,755 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,759 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,782 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:35:24,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,787 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,793 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 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,820 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:35:24,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,825 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,848 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:35:24,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:24,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:24,857 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 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,880 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:35:24,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:24,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:24,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:24,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:24,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:24,882 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:24,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:24,884 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:24,886 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:35:24,886 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:35:24,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:24,889 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:24,889 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:24,889 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_3 Supporting invariants [] [2020-07-29 01:35:24,920 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:35:24,923 INFO L393 LassoCheck]: Loop: "call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8;" [2020-07-29 01:35:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:24,927 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:24,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:24,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:24,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:24,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {1436#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1436#unseeded} is VALID [2020-07-29 01:35:24,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {1436#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {1436#unseeded} is VALID [2020-07-29 01:35:24,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {1436#unseeded} assume !(main_~length~0 < 1); {1436#unseeded} is VALID [2020-07-29 01:35:24,977 INFO L280 TraceCheckUtils]: 3: Hoare triple {1436#unseeded} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {1436#unseeded} is VALID [2020-07-29 01:35:24,978 INFO L280 TraceCheckUtils]: 4: Hoare triple {1436#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1436#unseeded} is VALID [2020-07-29 01:35:24,979 INFO L280 TraceCheckUtils]: 5: Hoare triple {1436#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1436#unseeded} is VALID [2020-07-29 01:35:24,980 INFO L280 TraceCheckUtils]: 6: Hoare triple {1436#unseeded} assume !(main_~val~0 < 0); {1436#unseeded} is VALID [2020-07-29 01:35:24,980 INFO L280 TraceCheckUtils]: 7: Hoare triple {1436#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1436#unseeded} is VALID [2020-07-29 01:35:24,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {1436#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1436#unseeded} is VALID [2020-07-29 01:35:24,981 INFO L280 TraceCheckUtils]: 9: Hoare triple {1436#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1436#unseeded} is VALID [2020-07-29 01:35:24,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {1436#unseeded} assume !(main_~val~0 < 0); {1436#unseeded} is VALID [2020-07-29 01:35:24,997 INFO L280 TraceCheckUtils]: 11: Hoare triple {1436#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1436#unseeded} is VALID [2020-07-29 01:35:24,997 INFO L280 TraceCheckUtils]: 12: Hoare triple {1436#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1436#unseeded} is VALID [2020-07-29 01:35:24,998 INFO L280 TraceCheckUtils]: 13: Hoare triple {1436#unseeded} assume !(main_~i~0 < main_~length~0); {1436#unseeded} is VALID [2020-07-29 01:35:24,999 INFO L280 TraceCheckUtils]: 14: Hoare triple {1436#unseeded} main_~j~0 := 0; {1436#unseeded} is VALID [2020-07-29 01:35:25,000 INFO L280 TraceCheckUtils]: 15: Hoare triple {1436#unseeded} assume !!(main_~j~0 < main_~length~0); {1436#unseeded} is VALID [2020-07-29 01:35:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:25,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:35:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:25,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:25,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {1439#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1514#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} is VALID [2020-07-29 01:35:25,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {1514#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; {1464#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:25,036 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:35:25,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:25,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:25,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:25,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,047 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:35:25,047 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:35:25,094 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2020-07-29 01:35:25,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:25,095 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:25,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:25,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:25,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:25,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:25,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:25,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:25,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:25,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2020-07-29 01:35:25,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:25,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:25,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:25,098 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:35:25,099 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:25,099 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:25,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:25,100 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:25,100 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 39 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:25,100 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:25,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:25,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:25,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:25,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:25,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:25,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:25,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:25,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:25,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:25,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:35:25,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:35:25,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:35:25,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:25,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:25,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:25,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:25,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:25,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:35:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:25,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:25,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,112 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:35:25,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:35:25,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:35:25,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:35:25,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:25,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. cyclomatic complexity: 13 [2020-07-29 01:35:25,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:25,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 32 transitions. [2020-07-29 01:35:25,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:35:25,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:35:25,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2020-07-29 01:35:25,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:35:25,117 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-29 01:35:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2020-07-29 01:35:25,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2020-07-29 01:35:25,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:25,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 32 transitions. Second operand 25 states. [2020-07-29 01:35:25,122 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 32 transitions. Second operand 25 states. [2020-07-29 01:35:25,122 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 25 states. [2020-07-29 01:35:25,124 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:25,129 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-29 01:35:25,130 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-29 01:35:25,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:25,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:25,130 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states and 32 transitions. [2020-07-29 01:35:25,132 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states and 32 transitions. [2020-07-29 01:35:25,133 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:35:25,139 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-29 01:35:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-29 01:35:25,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:25,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:25,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:25,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:35:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2020-07-29 01:35:25,144 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 01:35:25,144 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2020-07-29 01:35:25,144 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:35:25,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-07-29 01:35:25,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:25,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:25,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:25,145 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:35:25,145 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:35:25,147 INFO L794 eck$LassoCheckResult]: Stem: 1571#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1567#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 1568#L551 assume !(main_~length~0 < 1); 1573#L551-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1569#L553 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1570#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 1564#L556 assume !(main_~val~0 < 0); 1565#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1566#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1572#L554-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 1574#L556 assume !(main_~val~0 < 0); 1582#L556-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1581#L554-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1580#L554-3 assume !(main_~i~0 < main_~length~0); 1578#L554-4 main_~j~0 := 0; 1559#L561-3 assume !!(main_~j~0 < main_~length~0); 1560#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1576#L562-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 1577#L561-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 1561#L561-3 assume !!(main_~j~0 < main_~length~0); 1562#L562-3 [2020-07-29 01:35:25,147 INFO L796 eck$LassoCheckResult]: Loop: 1562#L562-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1575#L562-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; 1562#L562-3 [2020-07-29 01:35:25,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:25,148 INFO L82 PathProgramCache]: Analyzing trace with hash 34477914, now seen corresponding path program 3 times [2020-07-29 01:35:25,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:25,148 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19835745] [2020-07-29 01:35:25,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:25,182 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:25,208 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:25,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:25,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 5 times [2020-07-29 01:35:25,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:25,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551057823] [2020-07-29 01:35:25,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:25,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:25,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:25,232 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:25,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461473, now seen corresponding path program 1 times [2020-07-29 01:35:25,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:25,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483302790] [2020-07-29 01:35:25,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:25,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:25,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:25,307 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:25,603 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 84 [2020-07-29 01:35:25,742 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:25,742 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:25,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:25,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:25,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:25,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:25,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:25,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:25,744 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-2.i_Iteration8_Lasso [2020-07-29 01:35:25,744 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:25,744 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:25,763 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:35:25,766 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:35:25,769 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:35:25,773 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:35:25,776 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:35:25,781 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:35:25,790 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:35:25,794 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:35:25,797 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:35:25,962 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:35:25,962 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:35:25,967 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:35:25,970 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:35:25,976 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:35:25,980 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:35:25,983 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:35:26,511 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:35:26,512 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,517 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:35:26,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:26,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:26,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:26,521 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,543 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:35:26,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:26,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:26,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:26,549 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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,569 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:35:26,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:26,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:26,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:26,573 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 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,623 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:35:26,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:26,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:26,629 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 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,658 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:35:26,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:26,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:26,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:26,662 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 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,686 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:35:26,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:26,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:26,691 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 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,713 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:35:26,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:26,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,715 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:26,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:26,717 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 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,740 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:35:26,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:26,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:26,747 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 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,771 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:35:26,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:26,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:26,780 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,802 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:35:26,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:26,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:26,807 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 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,832 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:35:26,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:26,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:26,843 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,876 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:35:26,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:35:26,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:35:26,894 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,917 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:35:26,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:35:26,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:35:26,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:35:26,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:35:26,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:35:26,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:35:26,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:35:26,921 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:35:26,924 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:35:26,924 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:26,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:35:26,927 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:35:26,927 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:35:26,927 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_4 Supporting invariants [] [2020-07-29 01:35:26,961 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:35:26,964 INFO L393 LassoCheck]: Loop: "call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8;" [2020-07-29 01:35:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:26,970 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:35:26,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:27,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {1728#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1728#unseeded} is VALID [2020-07-29 01:35:27,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {1728#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {1728#unseeded} is VALID [2020-07-29 01:35:27,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {1728#unseeded} assume !(main_~length~0 < 1); {1728#unseeded} is VALID [2020-07-29 01:35:27,026 INFO L280 TraceCheckUtils]: 3: Hoare triple {1728#unseeded} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {1728#unseeded} is VALID [2020-07-29 01:35:27,027 INFO L280 TraceCheckUtils]: 4: Hoare triple {1728#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:35:27,030 INFO L280 TraceCheckUtils]: 5: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1728#unseeded} is VALID [2020-07-29 01:35:27,030 INFO L280 TraceCheckUtils]: 6: Hoare triple {1728#unseeded} assume !(main_~val~0 < 0); {1728#unseeded} is VALID [2020-07-29 01:35:27,031 INFO L280 TraceCheckUtils]: 7: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,031 INFO L280 TraceCheckUtils]: 8: Hoare triple {1728#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1728#unseeded} is VALID [2020-07-29 01:35:27,032 INFO L280 TraceCheckUtils]: 9: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1728#unseeded} is VALID [2020-07-29 01:35:27,033 INFO L280 TraceCheckUtils]: 10: Hoare triple {1728#unseeded} assume !(main_~val~0 < 0); {1728#unseeded} is VALID [2020-07-29 01:35:27,033 INFO L280 TraceCheckUtils]: 11: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,034 INFO L280 TraceCheckUtils]: 12: Hoare triple {1728#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1728#unseeded} is VALID [2020-07-29 01:35:27,034 INFO L280 TraceCheckUtils]: 13: Hoare triple {1728#unseeded} assume !(main_~i~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,034 INFO L280 TraceCheckUtils]: 14: Hoare triple {1728#unseeded} main_~j~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:35:27,035 INFO L280 TraceCheckUtils]: 15: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,035 INFO L280 TraceCheckUtils]: 16: Hoare triple {1728#unseeded} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,036 INFO L280 TraceCheckUtils]: 17: Hoare triple {1728#unseeded} assume !(main_#t~mem7 > 0);havoc main_#t~mem7; {1728#unseeded} is VALID [2020-07-29 01:35:27,036 INFO L280 TraceCheckUtils]: 18: Hoare triple {1728#unseeded} main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; {1728#unseeded} is VALID [2020-07-29 01:35:27,036 INFO L280 TraceCheckUtils]: 19: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:35:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:27,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {1731#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1823#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} is VALID [2020-07-29 01:35:27,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {1823#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; {1761#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:27,067 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:35:27,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:27,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:27,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,079 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:35:27,080 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:35:27,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2020-07-29 01:35:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:27,129 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:27,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:27,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:27,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:27,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2020-07-29 01:35:27,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:27,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:27,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:27,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:27,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:27,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:27,134 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 35 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:27,135 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:27,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:35:27,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:35:27,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:35:27,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,148 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:35:27,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,149 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:27,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {1728#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1728#unseeded} is VALID [2020-07-29 01:35:27,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {1728#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {1728#unseeded} is VALID [2020-07-29 01:35:27,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {1728#unseeded} assume !(main_~length~0 < 1); {1728#unseeded} is VALID [2020-07-29 01:35:27,204 INFO L280 TraceCheckUtils]: 3: Hoare triple {1728#unseeded} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {1728#unseeded} is VALID [2020-07-29 01:35:27,205 INFO L280 TraceCheckUtils]: 4: Hoare triple {1728#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:35:27,206 INFO L280 TraceCheckUtils]: 5: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1728#unseeded} is VALID [2020-07-29 01:35:27,206 INFO L280 TraceCheckUtils]: 6: Hoare triple {1728#unseeded} assume !(main_~val~0 < 0); {1728#unseeded} is VALID [2020-07-29 01:35:27,206 INFO L280 TraceCheckUtils]: 7: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,207 INFO L280 TraceCheckUtils]: 8: Hoare triple {1728#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1728#unseeded} is VALID [2020-07-29 01:35:27,207 INFO L280 TraceCheckUtils]: 9: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1728#unseeded} is VALID [2020-07-29 01:35:27,208 INFO L280 TraceCheckUtils]: 10: Hoare triple {1728#unseeded} assume !(main_~val~0 < 0); {1728#unseeded} is VALID [2020-07-29 01:35:27,208 INFO L280 TraceCheckUtils]: 11: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,208 INFO L280 TraceCheckUtils]: 12: Hoare triple {1728#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1728#unseeded} is VALID [2020-07-29 01:35:27,209 INFO L280 TraceCheckUtils]: 13: Hoare triple {1728#unseeded} assume !(main_~i~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,209 INFO L280 TraceCheckUtils]: 14: Hoare triple {1728#unseeded} main_~j~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:35:27,209 INFO L280 TraceCheckUtils]: 15: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,210 INFO L280 TraceCheckUtils]: 16: Hoare triple {1728#unseeded} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,210 INFO L280 TraceCheckUtils]: 17: Hoare triple {1728#unseeded} assume !(main_#t~mem7 > 0);havoc main_#t~mem7; {1728#unseeded} is VALID [2020-07-29 01:35:27,211 INFO L280 TraceCheckUtils]: 18: Hoare triple {1728#unseeded} main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; {1728#unseeded} is VALID [2020-07-29 01:35:27,211 INFO L280 TraceCheckUtils]: 19: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:35:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:27,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {1731#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1927#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} is VALID [2020-07-29 01:35:27,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {1927#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; {1761#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:27,241 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:35:27,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:27,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:27,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,253 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:35:27,253 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:35:27,287 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 29 states and 35 transitions. Complement of second has 7 states. [2020-07-29 01:35:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:27,287 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:27,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:27,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:27,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:27,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2020-07-29 01:35:27,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:27,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,290 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:27,290 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:27,290 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:27,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:27,291 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:27,291 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 35 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:27,292 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:27,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:35:27,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:35:27,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:35:27,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 35 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,299 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:27,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:35:27,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,301 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:35:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:35:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:27,359 INFO L280 TraceCheckUtils]: 0: Hoare triple {1728#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1728#unseeded} is VALID [2020-07-29 01:35:27,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {1728#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; {1728#unseeded} is VALID [2020-07-29 01:35:27,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {1728#unseeded} assume !(main_~length~0 < 1); {1728#unseeded} is VALID [2020-07-29 01:35:27,361 INFO L280 TraceCheckUtils]: 3: Hoare triple {1728#unseeded} call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; {1728#unseeded} is VALID [2020-07-29 01:35:27,361 INFO L280 TraceCheckUtils]: 4: Hoare triple {1728#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:35:27,362 INFO L280 TraceCheckUtils]: 5: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1728#unseeded} is VALID [2020-07-29 01:35:27,362 INFO L280 TraceCheckUtils]: 6: Hoare triple {1728#unseeded} assume !(main_~val~0 < 0); {1728#unseeded} is VALID [2020-07-29 01:35:27,363 INFO L280 TraceCheckUtils]: 7: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {1728#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1728#unseeded} is VALID [2020-07-29 01:35:27,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {1728#unseeded} assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; {1728#unseeded} is VALID [2020-07-29 01:35:27,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {1728#unseeded} assume !(main_~val~0 < 0); {1728#unseeded} is VALID [2020-07-29 01:35:27,364 INFO L280 TraceCheckUtils]: 11: Hoare triple {1728#unseeded} call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,365 INFO L280 TraceCheckUtils]: 12: Hoare triple {1728#unseeded} main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; {1728#unseeded} is VALID [2020-07-29 01:35:27,365 INFO L280 TraceCheckUtils]: 13: Hoare triple {1728#unseeded} assume !(main_~i~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {1728#unseeded} main_~j~0 := 0; {1728#unseeded} is VALID [2020-07-29 01:35:27,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {1728#unseeded} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1728#unseeded} is VALID [2020-07-29 01:35:27,367 INFO L280 TraceCheckUtils]: 17: Hoare triple {1728#unseeded} assume !(main_#t~mem7 > 0);havoc main_#t~mem7; {1728#unseeded} is VALID [2020-07-29 01:35:27,367 INFO L280 TraceCheckUtils]: 18: Hoare triple {1728#unseeded} main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; {1728#unseeded} is VALID [2020-07-29 01:35:27,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {1728#unseeded} assume !!(main_~j~0 < main_~length~0); {1728#unseeded} is VALID [2020-07-29 01:35:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:35:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:27,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:35:27,399 INFO L280 TraceCheckUtils]: 0: Hoare triple {1731#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)))} call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {2031#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} is VALID [2020-07-29 01:35:27,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {2031#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset)) oldRank0) (<= |ULTIMATE.start_main_#t~mem7| (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))))} assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post9;havoc main_#t~mem8; {1761#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:35:27,401 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:35:27,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:27,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:27,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,414 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:35:27,414 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:35:27,466 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 6 states. [2020-07-29 01:35:27,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:35:27,466 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:27,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:27,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:35:27,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:27,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:27,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:27,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2020-07-29 01:35:27,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:27,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:27,468 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 10 [2020-07-29 01:35:27,468 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:35:27,468 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:35:27,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:35:27,469 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:35:27,469 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 39 transitions. cyclomatic complexity: 12 [2020-07-29 01:35:27,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. cyclomatic complexity: 12 [2020-07-29 01:35:27,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:27,470 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:35:27,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:27,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:27,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:35:27,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:35:27,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:35:27,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 2 letters. [2020-07-29 01:35:27,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 39 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:35:27,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,476 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:35:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:35:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-29 01:35:27,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 2 letters. [2020-07-29 01:35:27,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 22 letters. Loop has 2 letters. [2020-07-29 01:35:27,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 20 letters. Loop has 4 letters. [2020-07-29 01:35:27,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:35:27,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. cyclomatic complexity: 12 [2020-07-29 01:35:27,479 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:27,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2020-07-29 01:35:27,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:35:27,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:35:27,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:35:27,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:27,479 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:27,479 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:27,480 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:35:27,480 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:35:27,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:35:27,480 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:35:27,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:35:27,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:35:27 BoogieIcfgContainer [2020-07-29 01:35:27,485 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:35:27,486 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:35:27,486 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:35:27,486 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:35:27,486 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:15" (3/4) ... [2020-07-29 01:35:27,489 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:35:27,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:35:27,491 INFO L168 Benchmark]: Toolchain (without parser) took 13554.09 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 397.9 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -271.3 MB). Peak memory consumption was 126.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,491 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:27,491 INFO L168 Benchmark]: CACSL2BoogieTranslator took 529.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.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:35:27,492 INFO L168 Benchmark]: Boogie Preprocessor took 30.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,493 INFO L168 Benchmark]: RCFGBuilder took 538.02 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,493 INFO L168 Benchmark]: BuchiAutomizer took 12395.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.1 MB). Peak memory consumption was 119.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:35:27,493 INFO L168 Benchmark]: Witness Printer took 3.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:35:27,496 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 529.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.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. * Boogie Preprocessor took 30.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 538.02 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12395.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 253.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -134.1 MB). Peak memory consumption was 119.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.72 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr + i * 4 + -4] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.3s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 9.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 5. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 135 SDtfs, 189 SDslu, 106 SDs, 0 SdLazy, 201 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax113 hnf97 lsp82 ukn75 mio100 lsp56 div100 bol100 ite100 ukn100 eq162 hnf90 smp92 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...