./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 94f95b6ef0a3c8650bd30cb1958ada590298bd1c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:39:01,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:01,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:01,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:01,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:01,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:01,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:01,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:01,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:01,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:01,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:01,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:01,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:01,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:01,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:01,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:01,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:01,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:01,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:01,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:01,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:01,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:01,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:01,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:01,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:01,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:01,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:01,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:01,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:01,535 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:01,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:01,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:01,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:01,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:01,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:01,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:01,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:01,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:01,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:01,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:01,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:01,546 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:39:01,583 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:01,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:01,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:01,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:01,592 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:01,592 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:01,592 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:01,593 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:01,593 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:01,593 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:01,593 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:01,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:01,594 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:01,595 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:01,595 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:01,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:01,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:01,596 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:01,596 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:01,596 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:01,597 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:01,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:01,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:01,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:01,598 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:01,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:01,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:01,599 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:01,600 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:01,601 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:01,602 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 -> 94f95b6ef0a3c8650bd30cb1958ada590298bd1c [2020-07-29 01:39:01,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:01,966 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:01,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:01,973 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:01,974 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:01,975 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2020-07-29 01:39:02,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10f162ab/9a2e9ee6208047e6ba03e43c901c15a9/FLAG29bb04b95 [2020-07-29 01:39:02,580 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:02,580 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/count_up_and_down_alloca.i [2020-07-29 01:39:02,589 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10f162ab/9a2e9ee6208047e6ba03e43c901c15a9/FLAG29bb04b95 [2020-07-29 01:39:02,878 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10f162ab/9a2e9ee6208047e6ba03e43c901c15a9 [2020-07-29 01:39:02,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:02,883 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:02,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:02,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:02,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:02,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:02" (1/1) ... [2020-07-29 01:39:02,894 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@193a3516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:02, skipping insertion in model container [2020-07-29 01:39:02,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:02" (1/1) ... [2020-07-29 01:39:02,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:02,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:03,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:03,408 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:03,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:03,554 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:03,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03 WrapperNode [2020-07-29 01:39:03,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:03,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:03,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:03,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:03,565 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:39:03" (1/1) ... [2020-07-29 01:39:03,579 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:39:03" (1/1) ... [2020-07-29 01:39:03,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:03,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:03,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:03,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:03,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (1/1) ... [2020-07-29 01:39:03,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (1/1) ... [2020-07-29 01:39:03,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (1/1) ... [2020-07-29 01:39:03,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (1/1) ... [2020-07-29 01:39:03,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (1/1) ... [2020-07-29 01:39:03,632 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (1/1) ... [2020-07-29 01:39:03,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (1/1) ... [2020-07-29 01:39:03,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:03,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:03,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:03,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:03,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (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:39:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:03,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:03,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:03,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:04,057 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:04,057 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:39:04,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:04 BoogieIcfgContainer [2020-07-29 01:39:04,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:04,063 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:04,063 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:04,068 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:04,069 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:04,069 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:02" (1/3) ... [2020-07-29 01:39:04,071 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79739af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:04, skipping insertion in model container [2020-07-29 01:39:04,071 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:04,072 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:03" (2/3) ... [2020-07-29 01:39:04,072 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79739af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:04, skipping insertion in model container [2020-07-29 01:39:04,072 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:04,073 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:04" (3/3) ... [2020-07-29 01:39:04,074 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca.i [2020-07-29 01:39:04,131 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:04,132 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:04,132 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:04,132 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:04,133 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:04,133 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:04,133 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:04,133 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:04,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 01:39:04,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:39:04,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:04,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:04,186 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:04,186 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:04,187 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:04,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 01:39:04,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:39:04,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:04,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:04,192 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:04,192 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:04,201 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 5#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 17#L367true assume !(main_~length~0 < 1); 3#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 15#L371-3true [2020-07-29 01:39:04,202 INFO L796 eck$LassoCheckResult]: Loop: 15#L371-3true assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 13#L371-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L371-3true [2020-07-29 01:39:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:39:04,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:04,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102018844] [2020-07-29 01:39:04,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:04,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2020-07-29 01:39:04,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:04,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800521777] [2020-07-29 01:39:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:04,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:04,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2020-07-29 01:39:04,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:04,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821251139] [2020-07-29 01:39:04,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:04,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:04,469 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:04,769 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-07-29 01:39:04,880 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:04,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:04,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:04,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:04,881 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:04,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:04,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:04,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:04,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration1_Lasso [2020-07-29 01:39:04,882 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:04,883 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:04,931 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:39:04,945 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:39:04,950 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:39:04,956 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:39:04,961 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:39:04,969 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:39:04,974 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:39:04,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:39:04,985 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:39:05,249 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:39:05,256 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:39:05,262 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:39:05,845 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:05,852 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:05,865 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:39:05,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:05,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:05,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:05,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:05,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:05,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:05,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:05,874 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:39:05,904 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:39:05,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:05,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:05,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:05,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:05,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:05,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:05,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:05,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:05,940 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:39:05,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:05,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:05,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:05,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:05,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:05,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:05,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:05,946 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:05,968 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:39:05,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:05,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:05,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:05,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:05,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:05,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:05,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:05,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,010 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:39:06,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:06,021 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:06,061 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:39:06,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:06,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:06,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,067 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:39:06,097 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:39:06,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,099 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:06,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:06,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:06,101 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:39:06,131 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:39:06,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:06,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:06,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:06,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 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:39:06,162 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:39:06,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:06,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:06,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:06,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,204 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:39:06,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:06,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,246 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:39:06,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:06,260 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,283 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:39:06,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:06,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:06,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:06,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:06,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:06,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:06,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:06,484 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:39:06,485 INFO L444 ModelExtractionUtils]: 9 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:06,515 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:06,521 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:39:06,521 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:06,522 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1) = -4*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 Supporting invariants [1*ULTIMATE.start_main_~arr~0.offset >= 0] [2020-07-29 01:39:06,578 INFO L297 tatePredicateManager]: 3 out of 5 supporting invariants were superfluous and have been removed [2020-07-29 01:39:06,589 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208;" "main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207;" [2020-07-29 01:39:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,606 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:06,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:06,707 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2020-07-29 01:39:06,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {26#unseeded} is VALID [2020-07-29 01:39:06,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~length~0 < 1); {26#unseeded} is VALID [2020-07-29 01:39:06,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {26#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {84#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:39:06,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; {66#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (>= ULTIMATE.start_main_~arr~0.offset 0) unseeded)} is VALID [2020-07-29 01:39:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:39:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:06,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:06,756 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#(and (>= oldRank0 (+ (* (- 4) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc206.base|))) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (>= ULTIMATE.start_main_~arr~0.offset 0))} assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; {88#(and (<= 0 ULTIMATE.start_main_~arr~0.offset) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0) 4) (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (+ oldRank0 (* 4 ULTIMATE.start_main_~i~0))))} is VALID [2020-07-29 01:39:06,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {88#(and (<= 0 ULTIMATE.start_main_~arr~0.offset) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= (+ ULTIMATE.start_main_~arr~0.offset (* 4 ULTIMATE.start_main_~i~0) 4) (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (+ oldRank0 (* 4 ULTIMATE.start_main_~i~0))))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {69#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (>= ULTIMATE.start_main_~arr~0.offset 0) (or (and (> oldRank0 (+ (* (- 4) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc206.base|))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:39:06,760 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:39:06,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:39:06,791 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:39:06,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:06,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:06,804 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:39:06,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2020-07-29 01:39:06,980 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 36 states and 51 transitions. Complement of second has 9 states. [2020-07-29 01:39:06,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:06,981 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:06,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 01:39:06,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:39:06,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:06,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:06,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:39:06,991 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:39:06,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:06,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:06,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2020-07-29 01:39:06,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:39:06,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:06,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:06,997 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states. [2020-07-29 01:39:06,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:39:07,001 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:39:07,002 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:39:07,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:39:07,005 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:07,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 51 transitions. cyclomatic complexity: 19 [2020-07-29 01:39:07,007 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:39:07,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:07,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:07,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:07,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:07,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:07,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:07,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:07,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:07,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:07,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:39:07,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:39:07,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:39:07,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:39:07,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:39:07,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:39:07,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:39:07,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:39:07,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:39:07,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:07,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:07,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:07,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:07,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:07,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:07,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:07,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:07,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:07,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:07,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:07,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:07,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:07,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:07,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:39:07,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:07,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:07,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:39:07,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:39:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:39:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:07,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:39:07,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:07,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:07,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:07,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:07,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:07,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:07,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:07,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:07,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:07,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:07,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:07,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 51 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:07,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,035 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:39:07,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2020-07-29 01:39:07,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:39:07,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:39:07,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:39:07,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:07,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 51 transitions. cyclomatic complexity: 19 [2020-07-29 01:39:07,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:39:07,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 13 states and 17 transitions. [2020-07-29 01:39:07,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:39:07,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:07,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:39:07,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:07,055 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:39:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:39:07,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:07,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:07,089 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:07,092 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:07,096 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:07,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:07,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:07,098 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:07,098 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:07,100 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:07,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:07,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:07,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:07,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:39:07,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:39:07,104 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:07,104 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:07,104 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:07,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:07,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:39:07,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:07,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:07,106 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:07,106 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:39:07,107 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 144#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 145#L367 assume !(main_~length~0 < 1); 149#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 150#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 151#L371-3 assume !(main_~i~0 < main_~length~0); 154#L371-4 main_~j~0 := 0; 143#L374-3 [2020-07-29 01:39:07,107 INFO L796 eck$LassoCheckResult]: Loop: 143#L374-3 assume !!(main_~j~0 < main_~length~0); 146#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 147#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 142#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 143#L374-3 [2020-07-29 01:39:07,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:07,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2020-07-29 01:39:07,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:07,108 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974888434] [2020-07-29 01:39:07,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:07,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:07,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:07,139 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:07,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:07,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2020-07-29 01:39:07,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:07,141 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330187879] [2020-07-29 01:39:07,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:07,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:07,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:07,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:07,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:07,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2020-07-29 01:39:07,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:07,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241982244] [2020-07-29 01:39:07,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:07,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:07,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:07,214 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:07,375 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-07-29 01:39:07,450 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:07,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:07,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:07,450 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:07,451 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:07,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:07,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:07,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:07,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration2_Lasso [2020-07-29 01:39:07,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:07,451 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:07,478 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:39:07,484 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:39:07,488 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:39:07,492 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:39:07,499 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:39:07,649 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:39:07,653 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:39:07,657 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:39:07,660 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:39:07,667 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:39:07,671 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:39:08,157 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:08,157 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:39:08,167 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:39:08,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:08,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:08,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:08,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:08,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:08,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:08,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:08,172 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:39:08,214 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:39:08,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:08,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:08,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:08,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:08,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:08,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:08,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:08,218 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:39:08,249 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:39:08,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:08,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:08,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:08,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:08,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:08,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:08,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:08,256 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:39:08,281 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:39:08,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:08,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:08,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:08,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:08,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:08,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:08,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:08,319 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:39:08,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:08,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:08,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:08,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:08,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:08,329 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:08,343 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:08,385 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:39:08,385 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:08,389 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:08,392 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:08,392 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:08,392 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:39:08,449 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:39:08,453 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < main_~length~0);" "call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !(main_#t~mem210 > 0);havoc main_#t~mem210;" "main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209;" [2020-07-29 01:39:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:08,492 INFO L280 TraceCheckUtils]: 0: Hoare triple {190#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {190#unseeded} is VALID [2020-07-29 01:39:08,493 INFO L280 TraceCheckUtils]: 1: Hoare triple {190#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {190#unseeded} is VALID [2020-07-29 01:39:08,493 INFO L280 TraceCheckUtils]: 2: Hoare triple {190#unseeded} assume !(main_~length~0 < 1); {190#unseeded} is VALID [2020-07-29 01:39:08,494 INFO L280 TraceCheckUtils]: 3: Hoare triple {190#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {190#unseeded} is VALID [2020-07-29 01:39:08,495 INFO L280 TraceCheckUtils]: 4: Hoare triple {190#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; {190#unseeded} is VALID [2020-07-29 01:39:08,495 INFO L280 TraceCheckUtils]: 5: Hoare triple {190#unseeded} assume !(main_~i~0 < main_~length~0); {190#unseeded} is VALID [2020-07-29 01:39:08,496 INFO L280 TraceCheckUtils]: 6: Hoare triple {190#unseeded} main_~j~0 := 0; {190#unseeded} is VALID [2020-07-29 01:39:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:39:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:08,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {193#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))} assume !!(main_~j~0 < main_~length~0); {241#(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:39:08,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#(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~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {241#(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:39:08,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {241#(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~mem210 > 0);havoc main_#t~mem210; {241#(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:39:08,536 INFO L280 TraceCheckUtils]: 3: Hoare triple {241#(and (< ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~length~0) (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~j~0)))} main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; {218#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:39:08,537 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:39:08,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:08,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,548 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:39:08,548 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:39:08,596 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 18 states and 24 transitions. Complement of second has 4 states. [2020-07-29 01:39:08,596 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:39:08,596 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:08,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:08,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:08,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:08,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:08,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:08,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:08,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:39:08,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:08,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:08,600 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:08,601 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:39:08,601 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:08,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,603 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:08,603 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:08,603 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:08,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:08,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:08,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:08,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:08,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:08,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:08,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,611 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:39:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:08,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:08,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:08,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:08,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:08,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:39:08,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:08,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:08,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:39:08,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:08,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:08,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:08,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:08,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:08,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:08,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:39:08,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:39:08,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:39:08,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:39:08,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,620 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2020-07-29 01:39:08,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:39:08,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:39:08,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 8 letters. [2020-07-29 01:39:08,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:08,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:08,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2020-07-29 01:39:08,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:39:08,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:39:08,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-07-29 01:39:08,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:08,627 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 01:39:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-07-29 01:39:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-07-29 01:39:08,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:08,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 23 transitions. Second operand 16 states. [2020-07-29 01:39:08,628 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 23 transitions. Second operand 16 states. [2020-07-29 01:39:08,628 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 16 states. [2020-07-29 01:39:08,629 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:08,632 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 01:39:08,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-29 01:39:08,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:08,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:08,633 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 17 states and 23 transitions. [2020-07-29 01:39:08,633 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 17 states and 23 transitions. [2020-07-29 01:39:08,634 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:08,636 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-07-29 01:39:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-07-29 01:39:08,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:08,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:08,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:08,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:08,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:39:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:39:08,638 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:39:08,638 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:39:08,638 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:08,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:39:08,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:08,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:08,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:08,639 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:08,639 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:08,640 INFO L794 eck$LassoCheckResult]: Stem: 284#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 281#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 282#L367 assume !(main_~length~0 < 1); 285#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 286#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 289#L371-3 assume !(main_~i~0 < main_~length~0); 290#L371-4 main_~j~0 := 0; 283#L374-3 assume !!(main_~j~0 < main_~length~0); 275#L375-3 [2020-07-29 01:39:08,640 INFO L796 eck$LassoCheckResult]: Loop: 275#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 276#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 275#L375-3 [2020-07-29 01:39:08,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:08,640 INFO L82 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2020-07-29 01:39:08,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:08,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961244317] [2020-07-29 01:39:08,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:08,652 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:08,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:08,666 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:08,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2020-07-29 01:39:08,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:08,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138037536] [2020-07-29 01:39:08,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:08,673 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:08,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:08,678 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:08,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2020-07-29 01:39:08,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:08,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128024852] [2020-07-29 01:39:08,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:08,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {386#true} is VALID [2020-07-29 01:39:08,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {386#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {386#true} is VALID [2020-07-29 01:39:08,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#true} assume !(main_~length~0 < 1); {386#true} is VALID [2020-07-29 01:39:08,837 INFO L280 TraceCheckUtils]: 3: Hoare triple {386#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {388#(= 0 ULTIMATE.start_main_~arr~0.offset)} is VALID [2020-07-29 01:39:08,838 INFO L280 TraceCheckUtils]: 4: Hoare triple {388#(= 0 ULTIMATE.start_main_~arr~0.offset)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; {389#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset) 0))} is VALID [2020-07-29 01:39:08,839 INFO L280 TraceCheckUtils]: 5: Hoare triple {389#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset) 0))} assume !(main_~i~0 < main_~length~0); {389#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset) 0))} is VALID [2020-07-29 01:39:08,840 INFO L280 TraceCheckUtils]: 6: Hoare triple {389#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset) 0))} main_~j~0 := 0; {390#(and (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) 0))} is VALID [2020-07-29 01:39:08,841 INFO L280 TraceCheckUtils]: 7: Hoare triple {390#(and (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) 0))} assume !!(main_~j~0 < main_~length~0); {390#(and (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) 0))} is VALID [2020-07-29 01:39:08,842 INFO L280 TraceCheckUtils]: 8: Hoare triple {390#(and (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset) (= (select (select |#memory_int| ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4))) 0))} call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {391#(= 0 |ULTIMATE.start_main_#t~mem210|)} is VALID [2020-07-29 01:39:08,843 INFO L280 TraceCheckUtils]: 9: Hoare triple {391#(= 0 |ULTIMATE.start_main_#t~mem210|)} assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; {387#false} is VALID [2020-07-29 01:39:08,845 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:39:08,845 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128024852] [2020-07-29 01:39:08,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:08,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:39:08,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586429540] [2020-07-29 01:39:08,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:08,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:39:08,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:39:08,892 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-07-29 01:39:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:09,049 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-29 01:39:09,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:39:09,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:39:09,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:09,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2020-07-29 01:39:09,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:09,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2020-07-29 01:39:09,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:39:09,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:39:09,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2020-07-29 01:39:09,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:09,076 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-07-29 01:39:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2020-07-29 01:39:09,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2020-07-29 01:39:09,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:09,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 32 transitions. Second operand 18 states. [2020-07-29 01:39:09,078 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 32 transitions. Second operand 18 states. [2020-07-29 01:39:09,078 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 18 states. [2020-07-29 01:39:09,079 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:09,081 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-07-29 01:39:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-07-29 01:39:09,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:09,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:09,082 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 25 states and 32 transitions. [2020-07-29 01:39:09,082 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 25 states and 32 transitions. [2020-07-29 01:39:09,083 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:09,085 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-07-29 01:39:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-07-29 01:39:09,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:09,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:09,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:09,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-07-29 01:39:09,088 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 01:39:09,088 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 01:39:09,088 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:39:09,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-07-29 01:39:09,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:09,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:09,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:09,090 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:09,090 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:09,090 INFO L794 eck$LassoCheckResult]: Stem: 429#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 421#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 422#L367 assume !(main_~length~0 < 1); 432#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 433#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 434#L371-3 assume !(main_~i~0 < main_~length~0); 437#L371-4 main_~j~0 := 0; 430#L374-3 assume !!(main_~j~0 < main_~length~0); 425#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 426#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 427#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 428#L374-3 assume !!(main_~j~0 < main_~length~0); 423#L375-3 [2020-07-29 01:39:09,090 INFO L796 eck$LassoCheckResult]: Loop: 423#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 424#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 423#L375-3 [2020-07-29 01:39:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,091 INFO L82 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2020-07-29 01:39:09,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575187315] [2020-07-29 01:39:09,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:09,171 INFO L280 TraceCheckUtils]: 0: Hoare triple {561#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {561#true} is VALID [2020-07-29 01:39:09,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {561#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {561#true} is VALID [2020-07-29 01:39:09,172 INFO L280 TraceCheckUtils]: 2: Hoare triple {561#true} assume !(main_~length~0 < 1); {561#true} is VALID [2020-07-29 01:39:09,172 INFO L280 TraceCheckUtils]: 3: Hoare triple {561#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {561#true} is VALID [2020-07-29 01:39:09,173 INFO L280 TraceCheckUtils]: 4: Hoare triple {561#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; {563#(= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:39:09,174 INFO L280 TraceCheckUtils]: 5: Hoare triple {563#(= 1 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < main_~length~0); {564#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:39:09,175 INFO L280 TraceCheckUtils]: 6: Hoare triple {564#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {565#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,176 INFO L280 TraceCheckUtils]: 7: Hoare triple {565#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {565#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,177 INFO L280 TraceCheckUtils]: 8: Hoare triple {565#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {565#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,178 INFO L280 TraceCheckUtils]: 9: Hoare triple {565#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem210 > 0);havoc main_#t~mem210; {565#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,178 INFO L280 TraceCheckUtils]: 10: Hoare triple {565#(and (<= ULTIMATE.start_main_~length~0 1) (= 0 ULTIMATE.start_main_~j~0))} main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; {566#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:39:09,179 INFO L280 TraceCheckUtils]: 11: Hoare triple {566#(<= ULTIMATE.start_main_~length~0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < main_~length~0); {562#false} is VALID [2020-07-29 01:39:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:09,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575187315] [2020-07-29 01:39:09,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978870558] [2020-07-29 01:39:09,181 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 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:39:09,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:39:09,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:39:09,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:09,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:09,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {561#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {561#true} is VALID [2020-07-29 01:39:09,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {561#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {561#true} is VALID [2020-07-29 01:39:09,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {561#true} assume !(main_~length~0 < 1); {561#true} is VALID [2020-07-29 01:39:09,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {561#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {561#true} is VALID [2020-07-29 01:39:09,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {561#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; {582#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:39:09,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {582#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < main_~length~0); {564#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:39:09,359 INFO L280 TraceCheckUtils]: 6: Hoare triple {564#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {589#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,361 INFO L280 TraceCheckUtils]: 7: Hoare triple {589#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {589#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,362 INFO L280 TraceCheckUtils]: 8: Hoare triple {589#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {589#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {589#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem210 > 0);havoc main_#t~mem210; {589#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {589#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; {602#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:39:09,364 INFO L280 TraceCheckUtils]: 11: Hoare triple {602#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~length~0); {562#false} is VALID [2020-07-29 01:39:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:09,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:39:09,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2020-07-29 01:39:09,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265379283] [2020-07-29 01:39:09,367 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:39:09,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2020-07-29 01:39:09,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771501926] [2020-07-29 01:39:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:09,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:39:09,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:39:09,475 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 01:39:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:09,680 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-29 01:39:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:39:09,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:39:09,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:09,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. [2020-07-29 01:39:09,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:09,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 22 transitions. [2020-07-29 01:39:09,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:39:09,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:09,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2020-07-29 01:39:09,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:09,702 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-29 01:39:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2020-07-29 01:39:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 01:39:09,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:09,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 22 transitions. Second operand 18 states. [2020-07-29 01:39:09,704 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 22 transitions. Second operand 18 states. [2020-07-29 01:39:09,704 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 18 states. [2020-07-29 01:39:09,705 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:09,707 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-29 01:39:09,707 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-29 01:39:09,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:09,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:09,707 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 22 transitions. [2020-07-29 01:39:09,708 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 22 transitions. [2020-07-29 01:39:09,708 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:09,710 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-29 01:39:09,710 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-29 01:39:09,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:09,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:09,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:09,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2020-07-29 01:39:09,712 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 01:39:09,712 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 01:39:09,712 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:39:09,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2020-07-29 01:39:09,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:09,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:09,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:09,713 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:09,713 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:39:09,713 INFO L794 eck$LassoCheckResult]: Stem: 657#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 653#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 654#L367 assume !(main_~length~0 < 1); 658#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 659#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 660#L371-3 assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 661#L371-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 662#L371-3 assume !(main_~i~0 < main_~length~0); 664#L371-4 main_~j~0 := 0; 655#L374-3 assume !!(main_~j~0 < main_~length~0); 656#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 663#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 647#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 648#L374-3 assume !!(main_~j~0 < main_~length~0); 649#L375-3 [2020-07-29 01:39:09,714 INFO L796 eck$LassoCheckResult]: Loop: 649#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 650#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 649#L375-3 [2020-07-29 01:39:09,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,714 INFO L82 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2020-07-29 01:39:09,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539375920] [2020-07-29 01:39:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,753 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2020-07-29 01:39:09,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801350108] [2020-07-29 01:39:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,764 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:09,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:09,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2020-07-29 01:39:09,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:09,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765230659] [2020-07-29 01:39:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,782 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:09,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:09,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:10,048 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2020-07-29 01:39:10,133 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:10,133 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:10,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:10,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:10,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:10,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:10,133 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:10,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:10,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca.i_Iteration5_Lasso [2020-07-29 01:39:10,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:10,134 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:10,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:39:10,155 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:39:10,159 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:39:10,290 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:39:10,294 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:39:10,297 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:39:10,300 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:39:10,304 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:39:10,308 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:39:10,311 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:39:10,313 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:39:10,317 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:39:10,797 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:10,797 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:39:10,800 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:39:10,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:10,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:10,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:10,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:10,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:10,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:10,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:10,803 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:39:10,826 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:39:10,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:10,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:10,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:10,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:10,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:10,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:10,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:10,829 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) [2020-07-29 01:39:10,864 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:39:10,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:10,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:10,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:10,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:10,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:10,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:10,875 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:39:10,909 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:39:10,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:10,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:10,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:10,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:10,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:10,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:10,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:10,913 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:10,917 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:39:10,917 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 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:39:10,920 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:39:10,920 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:39:10,920 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:10,920 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))_2) = 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))_2 Supporting invariants [] [2020-07-29 01:39:10,957 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:39:10,962 INFO L393 LassoCheck]: Loop: "call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211;" [2020-07-29 01:39:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:10,966 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:39:10,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:10,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:11,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {779#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {779#unseeded} is VALID [2020-07-29 01:39:11,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {779#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {779#unseeded} is VALID [2020-07-29 01:39:11,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {779#unseeded} assume !(main_~length~0 < 1); {779#unseeded} is VALID [2020-07-29 01:39:11,019 INFO L280 TraceCheckUtils]: 3: Hoare triple {779#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {779#unseeded} is VALID [2020-07-29 01:39:11,019 INFO L280 TraceCheckUtils]: 4: Hoare triple {779#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; {779#unseeded} is VALID [2020-07-29 01:39:11,019 INFO L280 TraceCheckUtils]: 5: Hoare triple {779#unseeded} assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; {779#unseeded} is VALID [2020-07-29 01:39:11,020 INFO L280 TraceCheckUtils]: 6: Hoare triple {779#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {779#unseeded} is VALID [2020-07-29 01:39:11,020 INFO L280 TraceCheckUtils]: 7: Hoare triple {779#unseeded} assume !(main_~i~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,021 INFO L280 TraceCheckUtils]: 8: Hoare triple {779#unseeded} main_~j~0 := 0; {779#unseeded} is VALID [2020-07-29 01:39:11,023 INFO L280 TraceCheckUtils]: 9: Hoare triple {779#unseeded} assume !!(main_~j~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,023 INFO L280 TraceCheckUtils]: 10: Hoare triple {779#unseeded} call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {779#unseeded} is VALID [2020-07-29 01:39:11,024 INFO L280 TraceCheckUtils]: 11: Hoare triple {779#unseeded} assume !(main_#t~mem210 > 0);havoc main_#t~mem210; {779#unseeded} is VALID [2020-07-29 01:39:11,024 INFO L280 TraceCheckUtils]: 12: Hoare triple {779#unseeded} main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; {779#unseeded} is VALID [2020-07-29 01:39:11,025 INFO L280 TraceCheckUtils]: 13: Hoare triple {779#unseeded} assume !!(main_~j~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:11,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {782#(>= 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~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {856#(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~mem210| (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:39:11,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {856#(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~mem210| (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~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; {812#(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:39:11,062 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:39:11,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:11,074 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:39:11,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,075 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:39:11,075 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:39:11,114 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2020-07-29 01:39:11,114 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:39:11,115 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:11,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:11,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:11,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:11,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:11,116 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:11,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:11,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2020-07-29 01:39:11,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:11,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:11,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:11,118 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:11,118 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:11,118 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:11,119 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:11,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 12 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:11,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:11,120 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:39:11,120 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 24 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:11,120 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:11,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:11,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,127 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:39:11,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,128 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:39:11,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:11,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {779#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {779#unseeded} is VALID [2020-07-29 01:39:11,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {779#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {779#unseeded} is VALID [2020-07-29 01:39:11,166 INFO L280 TraceCheckUtils]: 2: Hoare triple {779#unseeded} assume !(main_~length~0 < 1); {779#unseeded} is VALID [2020-07-29 01:39:11,167 INFO L280 TraceCheckUtils]: 3: Hoare triple {779#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {779#unseeded} is VALID [2020-07-29 01:39:11,167 INFO L280 TraceCheckUtils]: 4: Hoare triple {779#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; {779#unseeded} is VALID [2020-07-29 01:39:11,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {779#unseeded} assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; {779#unseeded} is VALID [2020-07-29 01:39:11,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {779#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {779#unseeded} is VALID [2020-07-29 01:39:11,169 INFO L280 TraceCheckUtils]: 7: Hoare triple {779#unseeded} assume !(main_~i~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {779#unseeded} main_~j~0 := 0; {779#unseeded} is VALID [2020-07-29 01:39:11,170 INFO L280 TraceCheckUtils]: 9: Hoare triple {779#unseeded} assume !!(main_~j~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,171 INFO L280 TraceCheckUtils]: 10: Hoare triple {779#unseeded} call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {779#unseeded} is VALID [2020-07-29 01:39:11,174 INFO L280 TraceCheckUtils]: 11: Hoare triple {779#unseeded} assume !(main_#t~mem210 > 0);havoc main_#t~mem210; {779#unseeded} is VALID [2020-07-29 01:39:11,175 INFO L280 TraceCheckUtils]: 12: Hoare triple {779#unseeded} main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; {779#unseeded} is VALID [2020-07-29 01:39:11,175 INFO L280 TraceCheckUtils]: 13: Hoare triple {779#unseeded} assume !!(main_~j~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:11,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {782#(>= 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~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {934#(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~mem210| (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:39:11,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {934#(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~mem210| (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~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; {812#(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:39:11,219 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:39:11,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:11,232 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:39:11,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,232 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:39:11,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:39:11,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2020-07-29 01:39:11,266 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:39:11,266 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:11,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:11,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:11,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:11,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:11,268 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:11,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:11,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 24 transitions. [2020-07-29 01:39:11,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:11,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:11,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:11,269 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:11,269 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:11,269 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:11,270 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:11,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 12 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:11,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:11,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:39:11,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 24 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:11,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:11,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:11,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:11,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:11,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 24 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,286 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:39:11,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,287 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:39:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:11,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {779#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {779#unseeded} is VALID [2020-07-29 01:39:11,336 INFO L280 TraceCheckUtils]: 1: Hoare triple {779#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {779#unseeded} is VALID [2020-07-29 01:39:11,337 INFO L280 TraceCheckUtils]: 2: Hoare triple {779#unseeded} assume !(main_~length~0 < 1); {779#unseeded} is VALID [2020-07-29 01:39:11,337 INFO L280 TraceCheckUtils]: 3: Hoare triple {779#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {779#unseeded} is VALID [2020-07-29 01:39:11,338 INFO L280 TraceCheckUtils]: 4: Hoare triple {779#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; {779#unseeded} is VALID [2020-07-29 01:39:11,338 INFO L280 TraceCheckUtils]: 5: Hoare triple {779#unseeded} assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; {779#unseeded} is VALID [2020-07-29 01:39:11,339 INFO L280 TraceCheckUtils]: 6: Hoare triple {779#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {779#unseeded} is VALID [2020-07-29 01:39:11,339 INFO L280 TraceCheckUtils]: 7: Hoare triple {779#unseeded} assume !(main_~i~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,340 INFO L280 TraceCheckUtils]: 8: Hoare triple {779#unseeded} main_~j~0 := 0; {779#unseeded} is VALID [2020-07-29 01:39:11,340 INFO L280 TraceCheckUtils]: 9: Hoare triple {779#unseeded} assume !!(main_~j~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,340 INFO L280 TraceCheckUtils]: 10: Hoare triple {779#unseeded} call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {779#unseeded} is VALID [2020-07-29 01:39:11,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {779#unseeded} assume !(main_#t~mem210 > 0);havoc main_#t~mem210; {779#unseeded} is VALID [2020-07-29 01:39:11,345 INFO L280 TraceCheckUtils]: 12: Hoare triple {779#unseeded} main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; {779#unseeded} is VALID [2020-07-29 01:39:11,346 INFO L280 TraceCheckUtils]: 13: Hoare triple {779#unseeded} assume !!(main_~j~0 < main_~length~0); {779#unseeded} is VALID [2020-07-29 01:39:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:39:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:11,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:11,381 INFO L280 TraceCheckUtils]: 0: Hoare triple {782#(>= 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~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {1012#(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~mem210| (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:39:11,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {1012#(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~mem210| (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~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; {812#(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:39:11,383 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:39:11,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:11,394 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:39:11,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,395 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:39:11,395 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:39:11,440 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 23 states and 28 transitions. Complement of second has 6 states. [2020-07-29 01:39:11,440 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:39:11,440 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:11,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:11,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:11,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:11,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:11,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:11,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:11,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:11,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2020-07-29 01:39:11,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:11,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:11,443 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 21 transitions. cyclomatic complexity: 6 [2020-07-29 01:39:11,443 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:39:11,443 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:11,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:11,444 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:11,445 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 01:39:11,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 01:39:11,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:11,445 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:39:11,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:11,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:11,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:11,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:39:11,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:39:11,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:39:11,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:39:11,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:39:11,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:39:11,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 21 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:11,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:11,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:11,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,454 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:39:11,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:39:11,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:39:11,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:39:11,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:11,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 01:39:11,457 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:11,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2020-07-29 01:39:11,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:39:11,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:39:11,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:39:11,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:11,457 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:11,457 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:11,457 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:39:11,458 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:39:11,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:39:11,458 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:39:11,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:39:11,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:39:11 BoogieIcfgContainer [2020-07-29 01:39:11,465 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:39:11,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:39:11,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:39:11,466 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:39:11,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:04" (3/4) ... [2020-07-29 01:39:11,470 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:39:11,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:39:11,472 INFO L168 Benchmark]: Toolchain (without parser) took 8589.57 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 960.2 MB in the beginning and 957.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 317.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:11,472 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:11,473 INFO L168 Benchmark]: CACSL2BoogieTranslator took 671.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:11,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.04 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:39:11,475 INFO L168 Benchmark]: Boogie Preprocessor took 30.09 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:11,475 INFO L168 Benchmark]: RCFGBuilder took 425.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:11,476 INFO L168 Benchmark]: BuchiAutomizer took 7401.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 1.1 GB in the beginning and 957.1 MB in the end (delta: 150.5 MB). Peak memory consumption was 304.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:39:11,476 INFO L168 Benchmark]: Witness Printer took 4.79 ms. Allocated memory is still 1.3 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:39:11,480 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 671.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.04 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.09 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 425.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7401.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.1 MB). Free memory was 1.1 GB in the beginning and 957.1 MB in the end (delta: 150.5 MB). Peak memory consumption was 304.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.79 ms. Allocated memory is still 1.3 GB. Free memory is still 957.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 6 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 73 SDtfs, 112 SDslu, 48 SDs, 0 SdLazy, 110 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital133 mio100 ax100 hnf97 lsp94 ukn79 mio100 lsp59 div100 bol100 ite100 ukn100 eq165 hnf86 smp95 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...