./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 149fdbbcb5d1f0b05c2de89b523b2d2cfc590a6f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 07:06:12,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:06:12,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:06:12,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:06:12,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:06:12,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:06:12,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:06:12,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:06:12,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:06:12,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:06:12,997 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:06:12,999 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:06:12,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:06:13,002 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:06:13,003 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:06:13,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:06:13,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:06:13,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:06:13,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:06:13,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:06:13,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:06:13,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:06:13,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:06:13,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:06:13,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:06:13,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:06:13,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:06:13,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:06:13,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:06:13,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:06:13,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:06:13,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:06:13,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:06:13,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:06:13,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:06:13,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:06:13,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:06:13,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:06:13,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:06:13,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:06:13,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:06:13,066 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:06:13,100 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:06:13,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:06:13,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:06:13,106 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:06:13,106 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:06:13,106 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:06:13,106 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:06:13,106 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:06:13,107 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:06:13,107 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:06:13,107 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:06:13,107 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:06:13,107 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:06:13,107 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:06:13,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:06:13,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:06:13,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:06:13,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:06:13,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:06:13,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:06:13,110 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:06:13,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:06:13,110 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:06:13,110 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:06:13,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:06:13,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:06:13,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:06:13,111 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:06:13,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:06:13,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:06:13,112 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:06:13,112 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:06:13,114 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:06:13,114 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 149fdbbcb5d1f0b05c2de89b523b2d2cfc590a6f [2020-10-20 07:06:13,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:06:13,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:06:13,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:06:13,370 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:06:13,371 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:06:13,372 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2020-10-20 07:06:13,451 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c66c79e/a83da545971b4ca7aba4e1eecb8254d7/FLAGca48f7f13 [2020-10-20 07:06:14,005 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:06:14,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2020-10-20 07:06:14,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c66c79e/a83da545971b4ca7aba4e1eecb8254d7/FLAGca48f7f13 [2020-10-20 07:06:14,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32c66c79e/a83da545971b4ca7aba4e1eecb8254d7 [2020-10-20 07:06:14,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:06:14,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:06:14,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:06:14,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:06:14,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:06:14,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4e647a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14, skipping insertion in model container [2020-10-20 07:06:14,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:06:14,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:06:14,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:06:14,563 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:06:14,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:06:14,613 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:06:14,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14 WrapperNode [2020-10-20 07:06:14,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:06:14,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:06:14,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:06:14,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:06:14,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:06:14,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:06:14,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:06:14,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:06:14,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... [2020-10-20 07:06:14,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:06:14,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:06:14,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:06:14,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:06:14,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:06:14,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:06:14,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:06:15,143 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:06:15,143 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-10-20 07:06:15,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:06:15 BoogieIcfgContainer [2020-10-20 07:06:15,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:06:15,147 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:06:15,147 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:06:15,152 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:06:15,154 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:06:15,155 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:06:14" (1/3) ... [2020-10-20 07:06:15,156 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17d594f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:06:15, skipping insertion in model container [2020-10-20 07:06:15,157 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:06:15,157 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:06:14" (2/3) ... [2020-10-20 07:06:15,157 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17d594f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:06:15, skipping insertion in model container [2020-10-20 07:06:15,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:06:15,158 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:06:15" (3/3) ... [2020-10-20 07:06:15,161 INFO L373 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2020-10-20 07:06:15,229 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:06:15,229 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:06:15,230 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:06:15,230 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:06:15,230 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:06:15,230 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:06:15,231 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:06:15,231 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:06:15,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2020-10-20 07:06:15,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-10-20 07:06:15,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:15,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:15,315 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:06:15,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:15,316 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:06:15,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states. [2020-10-20 07:06:15,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2020-10-20 07:06:15,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:15,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:15,325 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:06:15,325 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:15,332 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 16#L-1true main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 54#L27true assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 36#L30true assume !(main_~l~0 > 1);main_#t~post5 := main_~r~0;main_~r~0 := main_#t~post5 - 1;havoc main_#t~post5; 27#L59-1true [2020-10-20 07:06:15,332 INFO L796 eck$LassoCheckResult]: Loop: 27#L59-1true assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 68#L38-2true assume !true; 66#L38-3true assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 49#L18-36true assume !(0 == __VERIFIER_assert_~cond); 45#L18-38true __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 42#L18-39true assume !(0 == __VERIFIER_assert_~cond); 15#L18-41true main_#t~post9 := main_~r~0;main_~r~0 := main_#t~post9 - 1;havoc main_#t~post9; 27#L59-1true [2020-10-20 07:06:15,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2020-10-20 07:06:15,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:15,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919718422] [2020-10-20 07:06:15,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:15,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:15,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:15,499 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:15,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:15,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1098383874, now seen corresponding path program 1 times [2020-10-20 07:06:15,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:15,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109389513] [2020-10-20 07:06:15,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:15,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-10-20 07:06:15,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109389513] [2020-10-20 07:06:15,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:06:15,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:06:15,539 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127689724] [2020-10-20 07:06:15,546 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:15,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:15,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 07:06:15,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 07:06:15,567 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2020-10-20 07:06:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:15,579 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2020-10-20 07:06:15,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 07:06:15,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 76 transitions. [2020-10-20 07:06:15,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-20 07:06:15,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 37 states and 43 transitions. [2020-10-20 07:06:15,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-10-20 07:06:15,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-10-20 07:06:15,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2020-10-20 07:06:15,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:15,593 INFO L691 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-10-20 07:06:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2020-10-20 07:06:15,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-20 07:06:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 07:06:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2020-10-20 07:06:15,627 INFO L714 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-10-20 07:06:15,627 INFO L594 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-10-20 07:06:15,627 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:06:15,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2020-10-20 07:06:15,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2020-10-20 07:06:15,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:15,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:15,629 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:06:15,644 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:15,644 INFO L794 eck$LassoCheckResult]: Stem: 192#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 173#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 166#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 167#L30 assume !(main_~l~0 > 1);main_#t~post5 := main_~r~0;main_~r~0 := main_#t~post5 - 1;havoc main_#t~post5; 172#L59-1 [2020-10-20 07:06:15,644 INFO L796 eck$LassoCheckResult]: Loop: 172#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 177#L38-2 assume !(main_~j~0 <= main_~r~0); 180#L38-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 181#L18-36 assume !(0 == __VERIFIER_assert_~cond); 195#L18-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 193#L18-39 assume !(0 == __VERIFIER_assert_~cond); 171#L18-41 main_#t~post9 := main_~r~0;main_~r~0 := main_#t~post9 - 1;havoc main_#t~post9; 172#L59-1 [2020-10-20 07:06:15,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:15,645 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2020-10-20 07:06:15,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:15,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659005504] [2020-10-20 07:06:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:15,663 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:15,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:15,685 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:15,686 INFO L82 PathProgramCache]: Analyzing trace with hash -46187520, now seen corresponding path program 1 times [2020-10-20 07:06:15,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:15,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157679493] [2020-10-20 07:06:15,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:15,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157679493] [2020-10-20 07:06:15,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:06:15,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 07:06:15,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820770887] [2020-10-20 07:06:15,733 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:15,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:15,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 07:06:15,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 07:06:15,734 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-10-20 07:06:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:15,871 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2020-10-20 07:06:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:06:15,872 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 81 transitions. [2020-10-20 07:06:15,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-10-20 07:06:15,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 81 transitions. [2020-10-20 07:06:15,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-10-20 07:06:15,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2020-10-20 07:06:15,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 81 transitions. [2020-10-20 07:06:15,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:15,877 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 81 transitions. [2020-10-20 07:06:15,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 81 transitions. [2020-10-20 07:06:15,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 39. [2020-10-20 07:06:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 07:06:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2020-10-20 07:06:15,882 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-20 07:06:15,882 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-10-20 07:06:15,882 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:06:15,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2020-10-20 07:06:15,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-10-20 07:06:15,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:15,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:15,885 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:06:15,885 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:15,885 INFO L794 eck$LassoCheckResult]: Stem: 307#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 289#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 282#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 283#L30 assume !(main_~l~0 > 1);main_#t~post5 := main_~r~0;main_~r~0 := main_#t~post5 - 1;havoc main_#t~post5; 288#L59-1 [2020-10-20 07:06:15,885 INFO L796 eck$LassoCheckResult]: Loop: 288#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 298#L38-2 assume !(main_~j~0 <= main_~r~0); 296#L38-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 297#L18-30 assume !(0 == __VERIFIER_assert_~cond); 306#L18-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 304#L18-33 assume !(0 == __VERIFIER_assert_~cond); 300#L18-35 main_#t~post8 := main_~l~0;main_~l~0 := main_#t~post8 - 1;havoc main_#t~post8; 288#L59-1 [2020-10-20 07:06:15,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:15,901 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2020-10-20 07:06:15,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:15,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949255912] [2020-10-20 07:06:15,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:15,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:15,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:15,939 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:15,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:15,940 INFO L82 PathProgramCache]: Analyzing trace with hash -80542500, now seen corresponding path program 1 times [2020-10-20 07:06:15,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:15,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942961700] [2020-10-20 07:06:15,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:15,950 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:15,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:15,964 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:15,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:15,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1879278357, now seen corresponding path program 1 times [2020-10-20 07:06:15,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:15,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387133285] [2020-10-20 07:06:15,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:16,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387133285] [2020-10-20 07:06:16,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:06:16,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 07:06:16,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043621804] [2020-10-20 07:06:16,190 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:16,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:16,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:16,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:16,192 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:16,192 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:16,192 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:16,192 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:16,193 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2020-10-20 07:06:16,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:16,193 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:16,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:16,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:16,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:16,320 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:16,321 INFO L404 LassoAnalysis]: Checking for nontermination... 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-10-20 07:06:16,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:16,329 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-10-20 07:06:16,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:16,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:16,656 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:16,659 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:16,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:16,659 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:16,669 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:16,669 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:16,669 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:16,669 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:16,669 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:16,669 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2020-10-20 07:06:16,669 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:16,670 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:16,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:16,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:16,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:16,761 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:16,767 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:16,788 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-10-20 07:06:16,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:16,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:16,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:16,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:16,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:16,795 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:16,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:16,801 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-10-20 07:06:16,839 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-10-20 07:06:16,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:16,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:16,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:16,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:16,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:16,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:16,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:16,848 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-10-20 07:06:16,887 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-10-20 07:06:16,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:16,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:16,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:16,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:16,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:16,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:16,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:16,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:16,908 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:06:16,908 INFO L444 ModelExtractionUtils]: 4 out of 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:16,922 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:16,922 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:16,922 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:06:16,923 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:16,958 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:17,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:17,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:17,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:17,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,047 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 07:06:17,049 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-10-20 07:06:17,120 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 112 states and 133 transitions. Complement of second has 6 states. [2020-10-20 07:06:17,121 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-10-20 07:06:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:06:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2020-10-20 07:06:17,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 4 letters. Loop has 7 letters. [2020-10-20 07:06:17,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:17,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 7 letters. [2020-10-20 07:06:17,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:17,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 4 letters. Loop has 14 letters. [2020-10-20 07:06:17,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:17,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 133 transitions. [2020-10-20 07:06:17,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2020-10-20 07:06:17,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 107 states and 126 transitions. [2020-10-20 07:06:17,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2020-10-20 07:06:17,132 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2020-10-20 07:06:17,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 126 transitions. [2020-10-20 07:06:17,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:17,133 INFO L691 BuchiCegarLoop]: Abstraction has 107 states and 126 transitions. [2020-10-20 07:06:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 126 transitions. [2020-10-20 07:06:17,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2020-10-20 07:06:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-20 07:06:17,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 125 transitions. [2020-10-20 07:06:17,142 INFO L714 BuchiCegarLoop]: Abstraction has 106 states and 125 transitions. [2020-10-20 07:06:17,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:17,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 07:06:17,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 07:06:17,143 INFO L87 Difference]: Start difference. First operand 106 states and 125 transitions. Second operand 3 states. [2020-10-20 07:06:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:17,164 INFO L93 Difference]: Finished difference Result 128 states and 148 transitions. [2020-10-20 07:06:17,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 07:06:17,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 148 transitions. [2020-10-20 07:06:17,167 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2020-10-20 07:06:17,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 96 states and 111 transitions. [2020-10-20 07:06:17,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2020-10-20 07:06:17,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2020-10-20 07:06:17,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 111 transitions. [2020-10-20 07:06:17,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:17,171 INFO L691 BuchiCegarLoop]: Abstraction has 96 states and 111 transitions. [2020-10-20 07:06:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 111 transitions. [2020-10-20 07:06:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 65. [2020-10-20 07:06:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 07:06:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2020-10-20 07:06:17,177 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-20 07:06:17,177 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-20 07:06:17,177 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:06:17,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 76 transitions. [2020-10-20 07:06:17,178 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2020-10-20 07:06:17,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:17,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:17,179 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:06:17,180 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:17,180 INFO L794 eck$LassoCheckResult]: Stem: 752#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 731#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 724#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 725#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 743#L59-1 [2020-10-20 07:06:17,180 INFO L796 eck$LassoCheckResult]: Loop: 743#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 759#L38-2 assume !(main_~j~0 <= main_~r~0); 757#L38-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 750#L18-30 assume !(0 == __VERIFIER_assert_~cond); 749#L18-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 747#L18-33 assume !(0 == __VERIFIER_assert_~cond); 742#L18-35 main_#t~post8 := main_~l~0;main_~l~0 := main_#t~post8 - 1;havoc main_#t~post8; 743#L59-1 [2020-10-20 07:06:17,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2020-10-20 07:06:17,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24743886] [2020-10-20 07:06:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,210 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash -80542500, now seen corresponding path program 2 times [2020-10-20 07:06:17,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534653131] [2020-10-20 07:06:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:17,225 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:17,228 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:17,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1606342313, now seen corresponding path program 1 times [2020-10-20 07:06:17,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:17,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104476071] [2020-10-20 07:06:17,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:17,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104476071] [2020-10-20 07:06:17,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:06:17,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:06:17,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928877005] [2020-10-20 07:06:17,424 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:17,425 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:17,425 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:17,425 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:17,425 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:17,425 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:17,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:17,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:17,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2020-10-20 07:06:17,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:17,426 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:17,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:17,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:17,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:17,538 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:17,538 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-10-20 07:06:17,553 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:17,553 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:17,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:17,600 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:18,097 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:18,099 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:18,100 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:18,100 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:18,100 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:18,101 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:18,101 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:18,101 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:18,101 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:18,101 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration4_Loop [2020-10-20 07:06:18,101 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:18,101 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:18,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,181 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:18,181 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:18,197 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-10-20 07:06:18,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:18,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:18,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:18,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:18,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:18,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:18,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:18,204 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-10-20 07:06:18,243 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-10-20 07:06:18,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:18,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:18,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:18,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:18,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:18,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:18,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:18,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:18,282 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:06:18,283 INFO L444 ModelExtractionUtils]: 4 out of 7 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:18,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:18,290 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:18,290 INFO L510 LassoAnalysis]: Proved termination. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:18,290 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0) = 1*ULTIMATE.start_main_~l~0 Supporting invariants [] [2020-10-20 07:06:18,322 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:18,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:18,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:18,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:18,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:18,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:18,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-10-20 07:06:18,383 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-10-20 07:06:18,384 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 76 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-10-20 07:06:18,413 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 76 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 156 states and 182 transitions. Complement of second has 6 states. [2020-10-20 07:06:18,414 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-10-20 07:06:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:06:18,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2020-10-20 07:06:18,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 7 letters. [2020-10-20 07:06:18,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:18,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 11 letters. Loop has 7 letters. [2020-10-20 07:06:18,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:18,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 4 letters. Loop has 14 letters. [2020-10-20 07:06:18,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:18,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 182 transitions. [2020-10-20 07:06:18,418 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 83 [2020-10-20 07:06:18,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 121 states and 141 transitions. [2020-10-20 07:06:18,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-20 07:06:18,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-10-20 07:06:18,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 141 transitions. [2020-10-20 07:06:18,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:18,421 INFO L691 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2020-10-20 07:06:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 141 transitions. [2020-10-20 07:06:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 64. [2020-10-20 07:06:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 07:06:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2020-10-20 07:06:18,426 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-10-20 07:06:18,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:18,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:06:18,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:06:18,428 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 5 states. [2020-10-20 07:06:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:18,594 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2020-10-20 07:06:18,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:06:18,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 197 states and 221 transitions. [2020-10-20 07:06:18,597 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 120 [2020-10-20 07:06:18,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 197 states to 197 states and 221 transitions. [2020-10-20 07:06:18,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 148 [2020-10-20 07:06:18,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 148 [2020-10-20 07:06:18,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 221 transitions. [2020-10-20 07:06:18,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:18,600 INFO L691 BuchiCegarLoop]: Abstraction has 197 states and 221 transitions. [2020-10-20 07:06:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 221 transitions. [2020-10-20 07:06:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 65. [2020-10-20 07:06:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 07:06:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2020-10-20 07:06:18,605 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-20 07:06:18,605 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-20 07:06:18,605 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:06:18,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 76 transitions. [2020-10-20 07:06:18,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-10-20 07:06:18,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:18,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:18,606 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:06:18,606 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:18,607 INFO L794 eck$LassoCheckResult]: Stem: 1319#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1285#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 1273#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1274#L30 assume !(main_~l~0 > 1);main_#t~post5 := main_~r~0;main_~r~0 := main_#t~post5 - 1;havoc main_#t~post5; 1284#L59-1 [2020-10-20 07:06:18,607 INFO L796 eck$LassoCheckResult]: Loop: 1284#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1302#L38-2 assume !!(main_~j~0 <= main_~r~0); 1303#L39 assume !(main_~j~0 < main_~r~0); 1308#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1309#L18-12 assume !(0 == __VERIFIER_assert_~cond); 1312#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1326#L18-15 assume !(0 == __VERIFIER_assert_~cond); 1323#L18-17 assume 0 != main_#t~nondet7;havoc main_#t~nondet7; 1298#L38-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1299#L18-36 assume !(0 == __VERIFIER_assert_~cond); 1325#L18-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1322#L18-39 assume !(0 == __VERIFIER_assert_~cond); 1283#L18-41 main_#t~post9 := main_~r~0;main_~r~0 := main_#t~post9 - 1;havoc main_#t~post9; 1284#L59-1 [2020-10-20 07:06:18,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:18,607 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2020-10-20 07:06:18,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:18,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719143631] [2020-10-20 07:06:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,638 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1510380012, now seen corresponding path program 1 times [2020-10-20 07:06:18,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:18,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750957904] [2020-10-20 07:06:18,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:18,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:18,660 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:18,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1463197069, now seen corresponding path program 1 times [2020-10-20 07:06:18,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:18,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153447657] [2020-10-20 07:06:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:18,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153447657] [2020-10-20 07:06:18,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:06:18,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 07:06:18,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806490803] [2020-10-20 07:06:18,808 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-10-20 07:06:18,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:18,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:18,890 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:18,891 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:18,891 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:18,891 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:18,891 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:18,891 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:18,891 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:18,891 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:18,891 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2020-10-20 07:06:18,892 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:18,892 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:18,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:18,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,003 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:19,003 INFO L404 LassoAnalysis]: Checking for nontermination... 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-10-20 07:06:19,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:19,024 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-10-20 07:06:19,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:19,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:19,704 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:19,706 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:19,706 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:19,706 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:19,707 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:19,707 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:19,707 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,707 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:19,707 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:19,707 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2020-10-20 07:06:19,707 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:19,707 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:19,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:19,819 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:19,819 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,823 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-10-20 07:06:19,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:19,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:19,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:19,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:19,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:19,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:19,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:19,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:19,845 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 07:06:19,845 INFO L444 ModelExtractionUtils]: 4 out of 7 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:19,853 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:19,853 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:19,853 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:06:19,853 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:19,874 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:19,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:19,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:19,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:19,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:19,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:19,946 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-10-20 07:06:19,946 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 76 transitions. cyclomatic complexity: 13 Second operand 3 states. [2020-10-20 07:06:19,997 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 76 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 125 states and 145 transitions. Complement of second has 4 states. [2020-10-20 07:06:19,997 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-10-20 07:06:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:06:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-10-20 07:06:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 4 letters. Loop has 13 letters. [2020-10-20 07:06:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 17 letters. Loop has 13 letters. [2020-10-20 07:06:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:20,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 76 transitions. Stem has 4 letters. Loop has 26 letters. [2020-10-20 07:06:20,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:20,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 145 transitions. [2020-10-20 07:06:20,002 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2020-10-20 07:06:20,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 120 states and 139 transitions. [2020-10-20 07:06:20,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-10-20 07:06:20,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2020-10-20 07:06:20,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 139 transitions. [2020-10-20 07:06:20,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:20,006 INFO L691 BuchiCegarLoop]: Abstraction has 120 states and 139 transitions. [2020-10-20 07:06:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 139 transitions. [2020-10-20 07:06:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2020-10-20 07:06:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-10-20 07:06:20,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2020-10-20 07:06:20,012 INFO L714 BuchiCegarLoop]: Abstraction has 119 states and 138 transitions. [2020-10-20 07:06:20,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:20,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 07:06:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 07:06:20,019 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand 4 states. [2020-10-20 07:06:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:20,059 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2020-10-20 07:06:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 07:06:20,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 76 transitions. [2020-10-20 07:06:20,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-10-20 07:06:20,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 75 transitions. [2020-10-20 07:06:20,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2020-10-20 07:06:20,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2020-10-20 07:06:20,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 75 transitions. [2020-10-20 07:06:20,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:20,063 INFO L691 BuchiCegarLoop]: Abstraction has 65 states and 75 transitions. [2020-10-20 07:06:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 75 transitions. [2020-10-20 07:06:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-20 07:06:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 07:06:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2020-10-20 07:06:20,066 INFO L714 BuchiCegarLoop]: Abstraction has 65 states and 75 transitions. [2020-10-20 07:06:20,066 INFO L594 BuchiCegarLoop]: Abstraction has 65 states and 75 transitions. [2020-10-20 07:06:20,067 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:06:20,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 75 transitions. [2020-10-20 07:06:20,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2020-10-20 07:06:20,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:20,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:20,068 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-20 07:06:20,069 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:20,069 INFO L794 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 1735#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 1725#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 1726#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 1768#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1752#L38-2 [2020-10-20 07:06:20,069 INFO L796 eck$LassoCheckResult]: Loop: 1752#L38-2 assume !!(main_~j~0 <= main_~r~0); 1753#L39 assume !(main_~j~0 < main_~r~0); 1762#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1758#L18-12 assume !(0 == __VERIFIER_assert_~cond); 1759#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1776#L18-15 assume !(0 == __VERIFIER_assert_~cond); 1773#L18-17 assume 0 != main_#t~nondet7;havoc main_#t~nondet7; 1748#L38-3 assume !(main_~l~0 > 1);__VERIFIER_assert_#in~cond := (if 1 <= main_~r~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1749#L18-36 assume !(0 == __VERIFIER_assert_~cond); 1775#L18-38 __VERIFIER_assert_#in~cond := (if main_~r~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1772#L18-39 assume !(0 == __VERIFIER_assert_~cond); 1733#L18-41 main_#t~post9 := main_~r~0;main_~r~0 := main_#t~post9 - 1;havoc main_#t~post9; 1734#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 1752#L38-2 [2020-10-20 07:06:20,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:20,069 INFO L82 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 1 times [2020-10-20 07:06:20,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:20,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180462994] [2020-10-20 07:06:20,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,092 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash 436546004, now seen corresponding path program 2 times [2020-10-20 07:06:20,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:20,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993754376] [2020-10-20 07:06:20,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,105 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:20,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:20,115 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:20,116 INFO L82 PathProgramCache]: Analyzing trace with hash -605667418, now seen corresponding path program 1 times [2020-10-20 07:06:20,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:20,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377139601] [2020-10-20 07:06:20,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:20,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377139601] [2020-10-20 07:06:20,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:06:20,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:06:20,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289563165] [2020-10-20 07:06:20,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:20,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:20,335 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:20,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:20,335 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:20,335 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:20,336 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:20,336 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:20,336 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:20,336 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:20,336 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2020-10-20 07:06:20,336 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:20,336 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:20,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:20,449 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:20,449 INFO L404 LassoAnalysis]: Checking for nontermination... 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-10-20 07:06:20,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:20,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:20,459 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:20,459 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet7=-5} Honda state: {ULTIMATE.start_main_#t~nondet7=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-10-20 07:06:20,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:20,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:20,487 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:20,487 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post9=0} Honda state: {ULTIMATE.start_main_#t~post9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-10-20 07:06:20,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:20,513 INFO L160 nArgumentSynthesizer]: Using integer mode. 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-10-20 07:06:20,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:20,595 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:21,087 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:21,089 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:21,090 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:21,090 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:21,090 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:21,090 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:21,090 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:21,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:21,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:21,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2020-10-20 07:06:21,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:21,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:21,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:21,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:21,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:21,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:21,209 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:21,210 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:21,220 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-10-20 07:06:21,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:21,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:21,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:21,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:21,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:21,224 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:21,224 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:21,226 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 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-10-20 07:06:21,248 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-10-20 07:06:21,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:21,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:21,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:21,250 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 07:06:21,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:21,251 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 07:06:21,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:21,255 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-10-20 07:06:21,296 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-10-20 07:06:21,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:21,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:21,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:21,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:21,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:21,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:21,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:21,307 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-10-20 07:06:21,339 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 Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:21,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:21,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:21,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:21,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:21,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:21,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:21,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:21,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:21,362 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-10-20 07:06:21,362 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:06:21,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:21,366 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:21,366 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:06:21,367 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0) = 1*ULTIMATE.start_main_~r~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:21,393 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:21,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:21,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:06:21,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:21,491 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-10-20 07:06:21,491 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 75 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-10-20 07:06:21,526 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 75 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 129 states and 151 transitions. Complement of second has 6 states. [2020-10-20 07:06:21,527 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-10-20 07:06:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:06:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2020-10-20 07:06:21,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 13 letters. [2020-10-20 07:06:21,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:21,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 18 letters. Loop has 13 letters. [2020-10-20 07:06:21,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:21,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 5 letters. Loop has 26 letters. [2020-10-20 07:06:21,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:21,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 151 transitions. [2020-10-20 07:06:21,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 07:06:21,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 123 states and 144 transitions. [2020-10-20 07:06:21,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-10-20 07:06:21,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-10-20 07:06:21,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 144 transitions. [2020-10-20 07:06:21,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:21,533 INFO L691 BuchiCegarLoop]: Abstraction has 123 states and 144 transitions. [2020-10-20 07:06:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 144 transitions. [2020-10-20 07:06:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2020-10-20 07:06:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-20 07:06:21,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 141 transitions. [2020-10-20 07:06:21,541 INFO L714 BuchiCegarLoop]: Abstraction has 121 states and 141 transitions. [2020-10-20 07:06:21,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:21,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:06:21,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:06:21,541 INFO L87 Difference]: Start difference. First operand 121 states and 141 transitions. Second operand 6 states. [2020-10-20 07:06:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:21,732 INFO L93 Difference]: Finished difference Result 402 states and 448 transitions. [2020-10-20 07:06:21,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:06:21,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 402 states and 448 transitions. [2020-10-20 07:06:21,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2020-10-20 07:06:21,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 402 states to 354 states and 396 transitions. [2020-10-20 07:06:21,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2020-10-20 07:06:21,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2020-10-20 07:06:21,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 396 transitions. [2020-10-20 07:06:21,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:21,740 INFO L691 BuchiCegarLoop]: Abstraction has 354 states and 396 transitions. [2020-10-20 07:06:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 396 transitions. [2020-10-20 07:06:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 122. [2020-10-20 07:06:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-20 07:06:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2020-10-20 07:06:21,746 INFO L714 BuchiCegarLoop]: Abstraction has 122 states and 142 transitions. [2020-10-20 07:06:21,746 INFO L594 BuchiCegarLoop]: Abstraction has 122 states and 142 transitions. [2020-10-20 07:06:21,746 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 07:06:21,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 142 transitions. [2020-10-20 07:06:21,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 07:06:21,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:21,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:21,748 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:06:21,749 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:21,749 INFO L794 eck$LassoCheckResult]: Stem: 2579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 2544#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 2531#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2532#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 2564#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2566#L38-2 assume !!(main_~j~0 <= main_~r~0); 2559#L39 [2020-10-20 07:06:21,749 INFO L796 eck$LassoCheckResult]: Loop: 2559#L39 assume !(main_~j~0 < main_~r~0); 2567#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2568#L18-12 assume !(0 == __VERIFIER_assert_~cond); 2571#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2587#L18-15 assume !(0 == __VERIFIER_assert_~cond); 2583#L18-17 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2580#L18-18 assume !(0 == __VERIFIER_assert_~cond); 2539#L18-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2537#L18-21 assume !(0 == __VERIFIER_assert_~cond); 2533#L18-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2525#L18-24 assume !(0 == __VERIFIER_assert_~cond); 2526#L18-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2555#L18-27 assume !(0 == __VERIFIER_assert_~cond); 2549#L18-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2550#L38-2 assume !!(main_~j~0 <= main_~r~0); 2559#L39 [2020-10-20 07:06:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:21,750 INFO L82 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 1 times [2020-10-20 07:06:21,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:21,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222632716] [2020-10-20 07:06:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:21,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:21,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:21,769 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:21,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:21,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1922606789, now seen corresponding path program 1 times [2020-10-20 07:06:21,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:21,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139529048] [2020-10-20 07:06:21,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:21,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139529048] [2020-10-20 07:06:21,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:06:21,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 07:06:21,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223087824] [2020-10-20 07:06:21,827 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:06:21,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:06:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:06:21,828 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. cyclomatic complexity: 24 Second operand 6 states. [2020-10-20 07:06:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:21,983 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2020-10-20 07:06:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 07:06:21,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 239 transitions. [2020-10-20 07:06:21,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 07:06:21,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 199 states and 225 transitions. [2020-10-20 07:06:21,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-10-20 07:06:21,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-10-20 07:06:21,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 225 transitions. [2020-10-20 07:06:21,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:21,988 INFO L691 BuchiCegarLoop]: Abstraction has 199 states and 225 transitions. [2020-10-20 07:06:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 225 transitions. [2020-10-20 07:06:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 164. [2020-10-20 07:06:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-20 07:06:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2020-10-20 07:06:21,993 INFO L714 BuchiCegarLoop]: Abstraction has 164 states and 186 transitions. [2020-10-20 07:06:21,993 INFO L594 BuchiCegarLoop]: Abstraction has 164 states and 186 transitions. [2020-10-20 07:06:21,993 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 07:06:21,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 186 transitions. [2020-10-20 07:06:21,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 07:06:21,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:21,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:21,996 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:06:21,996 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:21,996 INFO L794 eck$LassoCheckResult]: Stem: 2942#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 2897#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 2884#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 2885#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 2918#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 2920#L38-2 assume !!(main_~j~0 <= main_~r~0); 2932#L39 [2020-10-20 07:06:21,997 INFO L796 eck$LassoCheckResult]: Loop: 2932#L39 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2888#L18 assume !(0 == __VERIFIER_assert_~cond); 2881#L18-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2873#L18-3 assume !(0 == __VERIFIER_assert_~cond); 2874#L18-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2906#L18-6 assume !(0 == __VERIFIER_assert_~cond); 2898#L18-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2899#L18-9 assume !(0 == __VERIFIER_assert_~cond); 2934#L18-11 assume 0 != main_#t~nondet6;havoc main_#t~nondet6;main_~j~0 := 1 + main_~j~0; 2923#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2924#L18-12 assume !(0 == __VERIFIER_assert_~cond); 2927#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2949#L18-15 assume !(0 == __VERIFIER_assert_~cond); 2946#L18-17 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2943#L18-18 assume !(0 == __VERIFIER_assert_~cond); 2893#L18-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2891#L18-21 assume !(0 == __VERIFIER_assert_~cond); 2886#L18-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2877#L18-24 assume !(0 == __VERIFIER_assert_~cond); 2878#L18-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2909#L18-27 assume !(0 == __VERIFIER_assert_~cond); 2902#L18-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 2903#L38-2 assume !!(main_~j~0 <= main_~r~0); 2932#L39 [2020-10-20 07:06:21,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:21,997 INFO L82 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 2 times [2020-10-20 07:06:21,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:21,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373416388] [2020-10-20 07:06:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:22,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:22,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:22,015 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:22,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1146797320, now seen corresponding path program 1 times [2020-10-20 07:06:22,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:22,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140704899] [2020-10-20 07:06:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:22,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:22,051 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:22,059 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:22,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash 780250170, now seen corresponding path program 1 times [2020-10-20 07:06:22,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:22,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959941396] [2020-10-20 07:06:22,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:22,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:22,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959941396] [2020-10-20 07:06:22,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099902391] [2020-10-20 07:06:22,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:06:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:22,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 07:06:22,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:22,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 07:06:22,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 07:06:22,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 07:06:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:22,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-10-20 07:06:22,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2020-10-20 07:06:22,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684920432] [2020-10-20 07:06:22,844 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2020-10-20 07:06:22,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:22,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:22,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:22,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:22,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:22,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:22,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:22,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:22,917 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:22,918 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:22,918 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:22,918 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:22,918 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:22,918 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:22,918 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:22,918 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:22,918 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2020-10-20 07:06:22,918 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:22,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:22,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:22,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:22,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:22,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:23,024 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:23,025 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:23,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:23,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:23,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 07:06:23,033 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet6=7} Honda state: {ULTIMATE.start_main_#t~nondet6=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:23,057 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:23,057 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:23,085 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:23,085 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:23,183 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:23,185 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:23,185 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:23,185 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:23,185 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:23,185 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:23,185 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:23,185 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:23,186 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:23,186 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2020-10-20 07:06:23,186 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:23,186 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:23,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:23,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:23,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:23,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:23,282 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:23,282 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:23,285 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-10-20 07:06:23,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:23,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:23,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:23,286 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 07:06:23,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:23,287 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 07:06:23,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:23,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:23,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:06:23,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:23,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:23,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:23,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:23,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:23,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:23,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:23,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:23,339 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-20 07:06:23,339 INFO L444 ModelExtractionUtils]: 2 out of 6 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:23,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:23,342 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:23,342 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:06:23,343 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~r~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-10-20 07:06:23,363 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:23,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:23,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:23,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:06:23,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:23,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:23,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:23,497 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-10-20 07:06:23,497 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 186 transitions. cyclomatic complexity: 26 Second operand 7 states. [2020-10-20 07:06:23,651 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 186 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 560 states and 602 transitions. Complement of second has 11 states. [2020-10-20 07:06:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-20 07:06:23,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2020-10-20 07:06:23,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 6 letters. Loop has 23 letters. [2020-10-20 07:06:23,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:23,653 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:06:23,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:23,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:23,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:23,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:06:23,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:23,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:23,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:23,821 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2020-10-20 07:06:23,821 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 186 transitions. cyclomatic complexity: 26 Second operand 7 states. [2020-10-20 07:06:24,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 186 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 668 states and 721 transitions. Complement of second has 17 states. [2020-10-20 07:06:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-20 07:06:24,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2020-10-20 07:06:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 99 transitions. Stem has 6 letters. Loop has 23 letters. [2020-10-20 07:06:24,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 99 transitions. Stem has 29 letters. Loop has 23 letters. [2020-10-20 07:06:24,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 99 transitions. Stem has 6 letters. Loop has 46 letters. [2020-10-20 07:06:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:24,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 668 states and 721 transitions. [2020-10-20 07:06:24,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 07:06:24,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 668 states to 493 states and 544 transitions. [2020-10-20 07:06:24,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2020-10-20 07:06:24,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2020-10-20 07:06:24,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 493 states and 544 transitions. [2020-10-20 07:06:24,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:24,133 INFO L691 BuchiCegarLoop]: Abstraction has 493 states and 544 transitions. [2020-10-20 07:06:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states and 544 transitions. [2020-10-20 07:06:24,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 290. [2020-10-20 07:06:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-10-20 07:06:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 324 transitions. [2020-10-20 07:06:24,140 INFO L714 BuchiCegarLoop]: Abstraction has 290 states and 324 transitions. [2020-10-20 07:06:24,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:06:24,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 07:06:24,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-20 07:06:24,141 INFO L87 Difference]: Start difference. First operand 290 states and 324 transitions. Second operand 7 states. [2020-10-20 07:06:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:06:24,568 INFO L93 Difference]: Finished difference Result 519 states and 565 transitions. [2020-10-20 07:06:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 07:06:24,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 519 states and 565 transitions. [2020-10-20 07:06:24,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 07:06:24,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 519 states to 303 states and 341 transitions. [2020-10-20 07:06:24,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-10-20 07:06:24,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-10-20 07:06:24,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 341 transitions. [2020-10-20 07:06:24,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:06:24,578 INFO L691 BuchiCegarLoop]: Abstraction has 303 states and 341 transitions. [2020-10-20 07:06:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 341 transitions. [2020-10-20 07:06:24,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 211. [2020-10-20 07:06:24,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-10-20 07:06:24,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 239 transitions. [2020-10-20 07:06:24,583 INFO L714 BuchiCegarLoop]: Abstraction has 211 states and 239 transitions. [2020-10-20 07:06:24,583 INFO L594 BuchiCegarLoop]: Abstraction has 211 states and 239 transitions. [2020-10-20 07:06:24,583 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 07:06:24,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 211 states and 239 transitions. [2020-10-20 07:06:24,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-10-20 07:06:24,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:06:24,585 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:06:24,586 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:24,586 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:06:24,587 INFO L794 eck$LassoCheckResult]: Stem: 5484#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(9); 5435#L-1 main_#in~argc, main_#in~argv.base, main_#in~argv.offset := #in~argc, #in~argv.base, #in~argv.offset;havoc main_#res;havoc main_#t~nondet3, main_#t~post4, main_#t~post5, main_#t~nondet6, main_#t~nondet7, main_#t~post8, main_#t~post9, main_~argc, main_~argv.base, main_~argv.offset, main_~n~0, main_~l~0, main_~r~0, main_~i~0, main_~j~0;main_~argc := main_#in~argc;main_~argv.base, main_~argv.offset := main_#in~argv.base, main_#in~argv.offset;havoc main_~n~0;havoc main_~l~0;havoc main_~r~0;havoc main_~i~0;havoc main_~j~0;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3; 5424#L27 assume !!(1 <= main_~n~0 && main_~n~0 <= 1000000);main_~l~0 := 1 + (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2);main_~r~0 := main_~n~0; 5425#L30 assume main_~l~0 > 1;main_#t~post4 := main_~l~0;main_~l~0 := main_#t~post4 - 1;havoc main_#t~post4; 5459#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5460#L38-2 assume !!(main_~j~0 <= main_~r~0); 5565#L39 assume !(main_~j~0 < main_~r~0); 5476#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5616#L18-12 assume !(0 == __VERIFIER_assert_~cond); 5614#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5612#L18-15 assume !(0 == __VERIFIER_assert_~cond); 5487#L18-17 assume 0 != main_#t~nondet7;havoc main_#t~nondet7; 5456#L38-3 assume main_~l~0 > 1;__VERIFIER_assert_#in~cond := (if 1 <= main_~l~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5481#L18-30 assume !(0 == __VERIFIER_assert_~cond); 5477#L18-32 __VERIFIER_assert_#in~cond := (if main_~l~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5478#L18-33 assume !(0 == __VERIFIER_assert_~cond); 5457#L18-35 main_#t~post8 := main_~l~0;main_~l~0 := main_#t~post8 - 1;havoc main_#t~post8; 5458#L59-1 assume !!(main_~r~0 > 1);main_~i~0 := main_~l~0;main_~j~0 := 2 * main_~l~0; 5441#L38-2 [2020-10-20 07:06:24,587 INFO L796 eck$LassoCheckResult]: Loop: 5441#L38-2 assume !!(main_~j~0 <= main_~r~0); 5474#L39 assume main_~j~0 < main_~r~0;__VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5426#L18 assume !(0 == __VERIFIER_assert_~cond); 5419#L18-2 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5411#L18-3 assume !(0 == __VERIFIER_assert_~cond); 5412#L18-5 __VERIFIER_assert_#in~cond := (if 1 <= 1 + main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5444#L18-6 assume !(0 == __VERIFIER_assert_~cond); 5436#L18-8 __VERIFIER_assert_#in~cond := (if 1 + main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5437#L18-9 assume !(0 == __VERIFIER_assert_~cond); 5471#L18-11 assume 0 != main_#t~nondet6;havoc main_#t~nondet6;main_~j~0 := 1 + main_~j~0; 5463#L39-1 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5464#L18-12 assume !(0 == __VERIFIER_assert_~cond); 5467#L18-14 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5490#L18-15 assume !(0 == __VERIFIER_assert_~cond); 5486#L18-17 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;__VERIFIER_assert_#in~cond := (if 1 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5482#L18-18 assume !(0 == __VERIFIER_assert_~cond); 5431#L18-20 __VERIFIER_assert_#in~cond := (if main_~i~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5429#L18-21 assume !(0 == __VERIFIER_assert_~cond); 5422#L18-23 __VERIFIER_assert_#in~cond := (if 1 <= main_~j~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5415#L18-24 assume !(0 == __VERIFIER_assert_~cond); 5416#L18-26 __VERIFIER_assert_#in~cond := (if main_~j~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5447#L18-27 assume !(0 == __VERIFIER_assert_~cond); 5440#L18-29 main_~i~0 := main_~j~0;main_~j~0 := 2 * main_~j~0; 5441#L38-2 [2020-10-20 07:06:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:24,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1670671798, now seen corresponding path program 1 times [2020-10-20 07:06:24,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:24,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560383494] [2020-10-20 07:06:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:24,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:24,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:24,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:24,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1478170350, now seen corresponding path program 2 times [2020-10-20 07:06:24,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:24,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192582374] [2020-10-20 07:06:24,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:24,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:24,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:24,638 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 50779305, now seen corresponding path program 1 times [2020-10-20 07:06:24,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:06:24,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901915701] [2020-10-20 07:06:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:06:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:24,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:06:24,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:06:24,690 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:06:24,887 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2020-10-20 07:06:24,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:24,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:24,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:24,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:24,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:24,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:24,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:24,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:24,974 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:24,975 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:24,975 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:24,975 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:24,975 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 07:06:24,975 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:24,975 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:24,975 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:24,975 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2020-10-20 07:06:24,975 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:24,975 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:24,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:24,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:24,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:24,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:25,069 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:25,069 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:25,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 07:06:25,073 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:25,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 07:06:25,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 07:06:25,206 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 07:06:25,207 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:06:25,208 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:06:25,208 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:06:25,208 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:06:25,208 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:06:25,208 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:25,208 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:06:25,208 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:06:25,208 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration9_Loop [2020-10-20 07:06:25,208 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:06:25,208 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:06:25,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:25,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:25,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:25,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:06:25,312 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:06:25,312 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:25,316 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-10-20 07:06:25,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:06:25,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:06:25,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:06:25,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:06:25,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:06:25,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:06:25,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:06:25,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:06:25,329 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-20 07:06:25,329 INFO L444 ModelExtractionUtils]: 2 out of 6 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:06:25,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:06:25,332 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 07:06:25,332 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:06:25,333 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-10-20 07:06:25,353 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 07:06:25,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:25,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:25,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:25,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-20 07:06:25,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:25,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:25,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:25,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:25,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:25,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:25,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:25,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:25,662 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2020-10-20 07:06:25,662 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32 Second operand 11 states. [2020-10-20 07:06:25,964 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32. Second operand 11 states. Result 425 states and 471 transitions. Complement of second has 17 states. [2020-10-20 07:06:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 07:06:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 62 transitions. [2020-10-20 07:06:25,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 62 transitions. Stem has 18 letters. Loop has 23 letters. [2020-10-20 07:06:25,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:25,968 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:06:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:25,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:25,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:26,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-20 07:06:26,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:26,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:26,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:26,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:26,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:26,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:26,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:26,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:26,253 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2020-10-20 07:06:26,253 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32 Second operand 11 states. [2020-10-20 07:06:26,951 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32. Second operand 11 states. Result 465 states and 511 transitions. Complement of second has 27 states. [2020-10-20 07:06:26,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 07:06:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 71 transitions. [2020-10-20 07:06:26,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 71 transitions. Stem has 18 letters. Loop has 23 letters. [2020-10-20 07:06:26,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:26,953 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:06:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:06:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:26,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:06:26,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:06:27,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-20 07:06:27,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:06:27,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:27,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:27,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:27,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:27,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:06:27,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:27,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:06:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:06:27,245 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 9 loop predicates [2020-10-20 07:06:27,245 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32 Second operand 11 states. [2020-10-20 07:06:27,610 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 211 states and 239 transitions. cyclomatic complexity: 32. Second operand 11 states. Result 763 states and 849 transitions. Complement of second has 16 states. [2020-10-20 07:06:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2020-10-20 07:06:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-20 07:06:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2020-10-20 07:06:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 125 transitions. Stem has 18 letters. Loop has 23 letters. [2020-10-20 07:06:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 125 transitions. Stem has 41 letters. Loop has 23 letters. [2020-10-20 07:06:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 125 transitions. Stem has 18 letters. Loop has 46 letters. [2020-10-20 07:06:27,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:06:27,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 763 states and 849 transitions. [2020-10-20 07:06:27,626 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:06:27,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 763 states to 0 states and 0 transitions. [2020-10-20 07:06:27,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 07:06:27,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 07:06:27,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 07:06:27,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:06:27,627 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:06:27,627 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:06:27,627 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:06:27,628 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 07:06:27,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 07:06:27,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:06:27,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 07:06:27,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 07:06:27 BoogieIcfgContainer [2020-10-20 07:06:27,636 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 07:06:27,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 07:06:27,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 07:06:27,638 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 07:06:27,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:06:15" (3/4) ... [2020-10-20 07:06:27,649 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 07:06:27,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 07:06:27,656 INFO L168 Benchmark]: Toolchain (without parser) took 13371.27 ms. Allocated memory was 42.5 MB in the beginning and 89.7 MB in the end (delta: 47.2 MB). Free memory was 22.9 MB in the beginning and 25.6 MB in the end (delta: -2.7 MB). Peak memory consumption was 44.5 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:27,660 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 32.0 MB. Free memory was 9.5 MB in the beginning and 9.4 MB in the end (delta: 45.6 kB). Peak memory consumption was 45.6 kB. Max. memory is 14.3 GB. [2020-10-20 07:06:27,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.23 ms. Allocated memory was 42.5 MB in the beginning and 43.0 MB in the end (delta: 524.3 kB). Free memory was 22.0 MB in the beginning and 23.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 13.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:27,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.63 ms. Allocated memory is still 43.0 MB. Free memory was 23.8 MB in the beginning and 21.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:27,666 INFO L168 Benchmark]: Boogie Preprocessor took 31.68 ms. Allocated memory is still 43.0 MB. Free memory was 21.6 MB in the beginning and 19.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:27,668 INFO L168 Benchmark]: RCFGBuilder took 451.78 ms. Allocated memory was 43.0 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Free memory was 19.7 MB in the beginning and 14.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 10.8 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:27,672 INFO L168 Benchmark]: BuchiAutomizer took 12488.77 ms. Allocated memory was 45.6 MB in the beginning and 89.7 MB in the end (delta: 44.0 MB). Free memory was 14.1 MB in the beginning and 25.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 32.6 MB. Max. memory is 14.3 GB. [2020-10-20 07:06:27,673 INFO L168 Benchmark]: Witness Printer took 11.89 ms. Allocated memory is still 89.7 MB. Free memory is still 25.6 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 07:06:27,679 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 32.0 MB. Free memory was 9.5 MB in the beginning and 9.4 MB in the end (delta: 45.6 kB). Peak memory consumption was 45.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 328.23 ms. Allocated memory was 42.5 MB in the beginning and 43.0 MB in the end (delta: 524.3 kB). Free memory was 22.0 MB in the beginning and 23.8 MB in the end (delta: -1.8 MB). Peak memory consumption was 13.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 46.63 ms. Allocated memory is still 43.0 MB. Free memory was 23.8 MB in the beginning and 21.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 31.68 ms. Allocated memory is still 43.0 MB. Free memory was 21.6 MB in the beginning and 19.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 451.78 ms. Allocated memory was 43.0 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Free memory was 19.7 MB in the beginning and 14.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 10.8 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 12488.77 ms. Allocated memory was 45.6 MB in the beginning and 89.7 MB in the end (delta: 44.0 MB). Free memory was 14.1 MB in the beginning and 25.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 32.6 MB. Max. memory is 14.3 GB. * Witness Printer took 11.89 ms. Allocated memory is still 89.7 MB. Free memory is still 25.6 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 14 terminating modules (8 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function l and consists of 4 locations. One deterministic module has affine ranking function r and consists of 3 locations. One deterministic module has affine ranking function r and consists of 4 locations. One deterministic module has affine ranking function 3 * r + -2 * j and consists of 9 locations. One nondeterministic module has affine ranking function 3 * n + -2 * j and consists of 9 locations. 8 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.4s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 7.3s. Construction of modules took 1.6s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 817 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 211 states and ocurred in iteration 8. Nontrivial modules had stage [4, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 806 SDtfs, 1354 SDslu, 1052 SDs, 0 SdLazy, 1441 SolverSat, 198 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT1 conc0 concLT5 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf97 lsp74 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf93 smp100 dnf100 smp100 tf105 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...