./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/half_2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/half_2.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 81e89597eb49ae8e9e99137a903318903f078a48 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 02:07:45,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:07:45,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:07:45,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:07:45,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:07:45,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:07:45,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:07:45,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:07:45,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:07:45,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:07:46,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:07:46,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:07:46,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:07:46,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:07:46,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:07:46,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:07:46,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:07:46,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:07:46,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:07:46,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:07:46,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:07:46,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:07:46,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:07:46,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:07:46,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:07:46,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:07:46,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:07:46,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:07:46,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:07:46,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:07:46,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:07:46,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:07:46,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:07:46,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:07:46,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:07:46,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:07:46,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:07:46,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:07:46,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:07:46,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:07:46,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:07:46,042 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:07:46,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:07:46,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:07:46,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:07:46,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:07:46,062 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:07:46,062 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:07:46,062 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:07:46,062 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:07:46,063 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:07:46,063 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:07:46,063 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:07:46,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:07:46,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:07:46,064 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:07:46,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:07:46,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:07:46,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:07:46,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:07:46,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:07:46,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:07:46,066 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:07:46,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:07:46,067 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:07:46,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:07:46,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:07:46,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:07:46,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:07:46,068 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:07:46,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:07:46,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:07:46,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:07:46,069 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:07:46,070 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:07:46,071 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 -> 81e89597eb49ae8e9e99137a903318903f078a48 [2020-07-29 02:07:46,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:07:46,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:07:46,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:07:46,383 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:07:46,384 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:07:46,385 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/half_2.i [2020-07-29 02:07:46,458 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c799a15c/a6bcbff3996d442bb496533b1772a201/FLAG2ce78f881 [2020-07-29 02:07:46,956 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:07:46,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/half_2.i [2020-07-29 02:07:46,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c799a15c/a6bcbff3996d442bb496533b1772a201/FLAG2ce78f881 [2020-07-29 02:07:47,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c799a15c/a6bcbff3996d442bb496533b1772a201 [2020-07-29 02:07:47,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:07:47,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:07:47,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:07:47,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:07:47,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:07:47,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a71b9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47, skipping insertion in model container [2020-07-29 02:07:47,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:07:47,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:07:47,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:07:47,537 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:07:47,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:07:47,573 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:07:47,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47 WrapperNode [2020-07-29 02:07:47,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:07:47,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:07:47,575 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:07:47,575 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:07:47,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:07:47,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:07:47,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:07:47,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:07:47,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,684 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... [2020-07-29 02:07:47,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:07:47,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:07:47,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:07:47,698 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:07:47,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:47,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:07:47,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:07:48,041 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:07:48,041 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 02:07:48,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:48 BoogieIcfgContainer [2020-07-29 02:07:48,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:07:48,046 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:07:48,046 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:07:48,051 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:07:48,053 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:48,053 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:07:47" (1/3) ... [2020-07-29 02:07:48,055 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5816b2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:07:48, skipping insertion in model container [2020-07-29 02:07:48,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:48,055 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:07:47" (2/3) ... [2020-07-29 02:07:48,056 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5816b2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:07:48, skipping insertion in model container [2020-07-29 02:07:48,056 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:07:48,056 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:48" (3/3) ... [2020-07-29 02:07:48,059 INFO L371 chiAutomizerObserver]: Analyzing ICFG half_2.i [2020-07-29 02:07:48,120 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:07:48,121 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:07:48,121 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:07:48,121 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:07:48,121 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:07:48,121 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:07:48,121 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:07:48,122 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:07:48,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 02:07:48,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 02:07:48,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:48,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:48,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:07:48,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 02:07:48,178 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:07:48,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 02:07:48,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 02:07:48,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:48,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:48,183 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:07:48,183 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 02:07:48,192 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_#t~post3, main_~n~0, main_~i~0, main_~k~0, main_~j~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 6#L16true assume !!(main_~n~0 <= 1000000);main_~k~0 := main_~n~0;main_~i~0 := 0; 9#L19-2true [2020-07-29 02:07:48,192 INFO L796 eck$LassoCheckResult]: Loop: 9#L19-2true assume !!(main_~i~0 < main_~n~0);main_#t~post1 := main_~k~0;main_~k~0 := main_#t~post1 - 1;havoc main_#t~post1;main_~i~0 := 2 + main_~i~0; 9#L19-2true [2020-07-29 02:07:48,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:48,198 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 1 times [2020-07-29 02:07:48,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:48,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850662115] [2020-07-29 02:07:48,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:48,296 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:48,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:48,322 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:48,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:48,324 INFO L82 PathProgramCache]: Analyzing trace with hash 46, now seen corresponding path program 1 times [2020-07-29 02:07:48,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:48,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106786866] [2020-07-29 02:07:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:48,348 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:48,359 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:48,364 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:48,370 INFO L82 PathProgramCache]: Analyzing trace with hash 30953, now seen corresponding path program 1 times [2020-07-29 02:07:48,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:48,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325980858] [2020-07-29 02:07:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:48,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:48,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:48,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:48,490 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:48,491 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:48,492 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:48,492 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:48,492 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:07:48,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:48,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:48,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:48,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: half_2.i_Iteration1_Loop [2020-07-29 02:07:48,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:48,495 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:48,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:48,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:48,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:48,707 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:48,708 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) [2020-07-29 02:07:48,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:48,725 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:48,772 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:07:48,772 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:48,800 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:48,800 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=0} Honda state: {ULTIMATE.start_main_~k~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~k~0=-1}, {ULTIMATE.start_main_~k~0=0}, {ULTIMATE.start_main_~k~0=0}] Lambdas: [1, 11, 10] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:48,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:48,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:07:48,832 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:48,832 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1=0} Honda state: {ULTIMATE.start_main_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:48,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:48,872 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:48,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:07:48,912 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:49,055 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:07:49,060 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:49,061 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:49,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:49,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:49,061 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:07:49,061 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:49,061 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:49,062 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:49,062 INFO L133 ssoRankerPreferences]: Filename of dumped script: half_2.i_Iteration1_Loop [2020-07-29 02:07:49,062 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:49,062 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:49,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:49,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:49,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:49,197 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:49,203 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:49,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:07:49,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:49,212 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:49,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:49,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:49,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:49,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:49,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:49,221 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:49,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:07:49,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:49,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:49,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:49,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:49,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:49,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:49,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:49,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:49,278 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:07:49,279 INFO L444 ModelExtractionUtils]: 1 out of 4 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:49,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:07:49,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:07:49,286 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:07:49,287 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:49,332 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:07:49,337 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);main_#t~post1 := main_~k~0;main_~k~0 := main_#t~post1 - 1;havoc main_#t~post1;main_~i~0 := 2 + main_~i~0;" [2020-07-29 02:07:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:49,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:49,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:07:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:49,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:49,411 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_#t~post3, main_~n~0, main_~i~0, main_~k~0, main_~j~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {22#unseeded} is VALID [2020-07-29 02:07:49,413 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#unseeded} assume !!(main_~n~0 <= 1000000);main_~k~0 := main_~n~0;main_~i~0 := 0; {22#unseeded} is VALID [2020-07-29 02:07:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:49,420 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:07:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:49,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:49,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~n~0);main_#t~post1 := main_~k~0;main_~k~0 := main_#t~post1 - 1;havoc main_#t~post1;main_~i~0 := 2 + main_~i~0; {35#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:07:49,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:49,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 02:07:49,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:49,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,465 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 02:07:49,466 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 2 states. [2020-07-29 02:07:49,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 2 states. Result 34 states and 44 transitions. Complement of second has 5 states. [2020-07-29 02:07:49,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:07:49,565 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:49,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-29 02:07:49,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 02:07:49,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:49,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:49,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 02:07:49,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 02:07:49,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:49,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:49,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 44 transitions. [2020-07-29 02:07:49,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:07:49,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:49,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:49,580 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states. [2020-07-29 02:07:49,585 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 02:07:49,587 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 02:07:49,587 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 02:07:49,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 02:07:49,591 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:07:49,593 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 34 states and 44 transitions. cyclomatic complexity: 14 [2020-07-29 02:07:49,596 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:07:49,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:07:49,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:07:49,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:07:49,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 02:07:49,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 34 letters. Loop has 34 letters. [2020-07-29 02:07:49,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 34 letters. Loop has 34 letters. [2020-07-29 02:07:49,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 02:07:49,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 02:07:49,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 12 letters. [2020-07-29 02:07:49,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:07:49,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:49,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:49,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:49,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:49,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:49,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:49,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:49,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:49,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 4 letters. [2020-07-29 02:07:49,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:07:49,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:07:49,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:07:49,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:49,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:49,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:49,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:49,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:49,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:49,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 34 states and 44 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:49,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,644 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 02:07:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2020-07-29 02:07:49,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:07:49,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 02:07:49,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 02:07:49,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:49,658 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. cyclomatic complexity: 14 [2020-07-29 02:07:49,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:07:49,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 8 states and 10 transitions. [2020-07-29 02:07:49,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 02:07:49,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 02:07:49,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-07-29 02:07:49,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:07:49,670 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 02:07:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-07-29 02:07:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 02:07:49,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:07:49,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 02:07:49,699 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 02:07:49,701 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 02:07:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:07:49,704 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 02:07:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-29 02:07:49,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:49,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:49,706 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 10 transitions. [2020-07-29 02:07:49,706 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 10 transitions. [2020-07-29 02:07:49,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:07:49,707 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 02:07:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-29 02:07:49,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:07:49,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:07:49,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:07:49,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:07:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 02:07:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 02:07:49,710 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 02:07:49,710 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 02:07:49,711 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:07:49,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 02:07:49,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:07:49,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:49,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:49,712 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 02:07:49,712 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:07:49,712 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_#t~post3, main_~n~0, main_~i~0, main_~k~0, main_~j~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 88#L16 assume !!(main_~n~0 <= 1000000);main_~k~0 := main_~n~0;main_~i~0 := 0; 89#L19-2 assume !(main_~i~0 < main_~n~0); 86#L19-3 main_~j~0 := 0; 85#L24-2 [2020-07-29 02:07:49,713 INFO L796 eck$LassoCheckResult]: Loop: 85#L24-2 assume !!(main_~j~0 < (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2));__VERIFIER_assert_#in~cond := (if main_~k~0 > 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 90#L7 assume !(0 == __VERIFIER_assert_~cond); 84#L7-2 main_#t~post2 := main_~k~0;main_~k~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; 85#L24-2 [2020-07-29 02:07:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash 959500, now seen corresponding path program 1 times [2020-07-29 02:07:49,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:49,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41267816] [2020-07-29 02:07:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:49,719 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:49,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:49,725 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:49,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash 57822, now seen corresponding path program 1 times [2020-07-29 02:07:49,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:49,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359253073] [2020-07-29 02:07:49,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:49,743 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:07:49,757 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:07:49,760 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:07:49,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:49,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1480278541, now seen corresponding path program 1 times [2020-07-29 02:07:49,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:07:49,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409422770] [2020-07-29 02:07:49,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:07:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:49,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_#t~post3, main_~n~0, main_~i~0, main_~k~0, main_~j~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {115#true} is VALID [2020-07-29 02:07:49,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {115#true} assume !!(main_~n~0 <= 1000000);main_~k~0 := main_~n~0;main_~i~0 := 0; {117#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 02:07:49,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {117#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_~i~0 < main_~n~0); {118#(<= ULTIMATE.start_main_~n~0 0)} is VALID [2020-07-29 02:07:49,898 INFO L280 TraceCheckUtils]: 3: Hoare triple {118#(<= ULTIMATE.start_main_~n~0 0)} main_~j~0 := 0; {119#(<= ULTIMATE.start_main_~n~0 (* 2 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 02:07:49,899 INFO L280 TraceCheckUtils]: 4: Hoare triple {119#(<= ULTIMATE.start_main_~n~0 (* 2 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2));__VERIFIER_assert_#in~cond := (if main_~k~0 > 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {116#false} is VALID [2020-07-29 02:07:49,900 INFO L280 TraceCheckUtils]: 5: Hoare triple {116#false} assume !(0 == __VERIFIER_assert_~cond); {116#false} is VALID [2020-07-29 02:07:49,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {116#false} main_#t~post2 := main_~k~0;main_~k~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {116#false} is VALID [2020-07-29 02:07:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:49,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409422770] [2020-07-29 02:07:49,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:07:49,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 02:07:49,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385061921] [2020-07-29 02:07:50,023 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:50,024 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:50,024 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:50,024 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:50,024 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:07:50,024 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:50,024 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:50,025 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:50,025 INFO L133 ssoRankerPreferences]: Filename of dumped script: half_2.i_Iteration2_Loop [2020-07-29 02:07:50,025 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:50,025 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:50,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:50,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:50,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:50,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:50,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:50,412 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2020-07-29 02:07:50,465 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:50,467 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:50,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:50,483 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:50,491 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:07:50,491 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 02:07:50,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:07:50,546 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:50,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:07:50,600 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:50,965 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:07:50,967 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:07:50,967 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:07:50,968 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:07:50,968 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:07:50,968 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:07:50,968 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:50,968 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:07:50,968 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:07:50,968 INFO L133 ssoRankerPreferences]: Filename of dumped script: half_2.i_Iteration2_Loop [2020-07-29 02:07:50,968 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:07:50,969 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:07:50,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:50,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-07-29 02:07:51,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:51,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:51,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:07:51,406 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2020-07-29 02:07:51,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:07:51,446 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:07:51,451 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:51,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:51,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:51,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:51,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:07:51,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:51,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:07:51,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:51,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:51,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:07:51,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:07:51,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:07:51,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:07:51,501 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 02:07:51,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:07:51,504 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 02:07:51,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:07:51,510 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:07:51,522 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:07:51,522 INFO L444 ModelExtractionUtils]: 1 out of 4 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:07:51,531 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:07:51,531 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:07:51,531 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:07:51,531 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~n~0 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-07-29 02:07:51,588 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:07:51,594 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2));__VERIFIER_assert_#in~cond := (if main_~k~0 > 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;" "assume !(0 == __VERIFIER_assert_~cond);" "main_#t~post2 := main_~k~0;main_~k~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3;" [2020-07-29 02:07:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:07:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:51,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:07:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:51,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:51,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {120#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_#t~post3, main_~n~0, main_~i~0, main_~k~0, main_~j~0;havoc main_~n~0;havoc main_~i~0;havoc main_~k~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; {120#unseeded} is VALID [2020-07-29 02:07:51,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {120#unseeded} assume !!(main_~n~0 <= 1000000);main_~k~0 := main_~n~0;main_~i~0 := 0; {120#unseeded} is VALID [2020-07-29 02:07:51,651 INFO L280 TraceCheckUtils]: 2: Hoare triple {120#unseeded} assume !(main_~i~0 < main_~n~0); {120#unseeded} is VALID [2020-07-29 02:07:51,652 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#unseeded} main_~j~0 := 0; {120#unseeded} is VALID [2020-07-29 02:07:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:51,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:07:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:07:51,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:07:51,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 2) ULTIMATE.start_main_~j~0)))} assume !!(main_~j~0 < (if main_~n~0 < 0 && 0 != main_~n~0 % 2 then 1 + main_~n~0 / 2 else main_~n~0 / 2));__VERIFIER_assert_#in~cond := (if main_~k~0 > 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {147#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 (* 2 ULTIMATE.start_main_~j~0))) (or (and (not (= 0 (mod ULTIMATE.start_main_~n~0 2))) (< ULTIMATE.start_main_~n~0 0) (< ULTIMATE.start_main_~j~0 (+ (div ULTIMATE.start_main_~n~0 2) 1))) (< ULTIMATE.start_main_~j~0 (div ULTIMATE.start_main_~n~0 2))))} is VALID [2020-07-29 02:07:51,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {147#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 (* 2 ULTIMATE.start_main_~j~0))) (or (and (not (= 0 (mod ULTIMATE.start_main_~n~0 2))) (< ULTIMATE.start_main_~n~0 0) (< ULTIMATE.start_main_~j~0 (+ (div ULTIMATE.start_main_~n~0 2) 1))) (< ULTIMATE.start_main_~j~0 (div ULTIMATE.start_main_~n~0 2))))} assume !(0 == __VERIFIER_assert_~cond); {147#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 (* 2 ULTIMATE.start_main_~j~0))) (or (and (not (= 0 (mod ULTIMATE.start_main_~n~0 2))) (< ULTIMATE.start_main_~n~0 0) (< ULTIMATE.start_main_~j~0 (+ (div ULTIMATE.start_main_~n~0 2) 1))) (< ULTIMATE.start_main_~j~0 (div ULTIMATE.start_main_~n~0 2))))} is VALID [2020-07-29 02:07:51,740 INFO L280 TraceCheckUtils]: 2: Hoare triple {147#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 (* 2 ULTIMATE.start_main_~j~0))) (or (and (not (= 0 (mod ULTIMATE.start_main_~n~0 2))) (< ULTIMATE.start_main_~n~0 0) (< ULTIMATE.start_main_~j~0 (+ (div ULTIMATE.start_main_~n~0 2) 1))) (< ULTIMATE.start_main_~j~0 (div ULTIMATE.start_main_~n~0 2))))} main_#t~post2 := main_~k~0;main_~k~0 := main_#t~post2 - 1;havoc main_#t~post2;main_#t~post3 := main_~j~0;main_~j~0 := 1 + main_#t~post3;havoc main_#t~post3; {133#(or (and (>= oldRank0 0) (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 2) ULTIMATE.start_main_~j~0)))) unseeded)} is VALID [2020-07-29 02:07:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:07:51,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:07:51,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:51,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:51,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,756 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 02:07:51,756 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 02:07:51,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 11 states and 14 transitions. Complement of second has 4 states. [2020-07-29 02:07:51,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:07:51,811 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:51,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 02:07:51,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:51,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:51,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:07:51,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:07:51,812 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:07:51,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:07:51,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 02:07:51,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:07:51,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:07:51,814 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 02:07:51,815 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:07:51,815 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:07:51,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:07:51,817 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:07:51,817 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 02:07:51,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 02:07:51,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:07:51,817 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:07:51,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:51,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:51,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:51,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:51,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:51,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:51,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:07:51,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:07:51,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:07:51,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 02:07:51,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 02:07:51,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2020-07-29 02:07:51,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:07:51,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:07:51,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:07:51,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:51,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:51,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:07:51,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:51,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:51,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:51,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:51,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:51,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:07:51,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:51,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:51,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:07:51,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,831 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:07:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:07:51,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 02:07:51,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:07:51,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:07:51,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-29 02:07:51,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:07:51,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 02:07:51,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:07:51,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-07-29 02:07:51,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:07:51,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:07:51,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:07:51,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:07:51,837 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:51,837 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:51,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:07:51,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 02:07:51,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 02:07:51,842 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2020-07-29 02:07:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:07:51,843 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 02:07:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 02:07:51,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 02:07:51,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:07:51,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 02:07:51,855 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:07:51,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 02:07:51,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:07:51,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:07:51,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:07:51,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:07:51,857 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:51,857 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:51,857 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:07:51,857 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:07:51,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 02:07:51,857 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:07:51,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:07:51,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:07:51 BoogieIcfgContainer [2020-07-29 02:07:51,866 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:07:51,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:07:51,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:07:51,867 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:07:51,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:07:48" (3/4) ... [2020-07-29 02:07:51,871 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 02:07:51,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:07:51,874 INFO L168 Benchmark]: Toolchain (without parser) took 4547.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -180.5 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:51,874 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:07:51,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.37 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:51,876 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.9 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:51,877 INFO L168 Benchmark]: Boogie Preprocessor took 24.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:07:51,878 INFO L168 Benchmark]: RCFGBuilder took 348.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:51,879 INFO L168 Benchmark]: BuchiAutomizer took 3819.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.6 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2020-07-29 02:07:51,879 INFO L168 Benchmark]: Witness Printer took 5.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:07:51,884 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.37 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 98.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.9 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 348.07 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3819.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -25.6 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function n + -2 * j and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 18 SDtfs, 21 SDslu, 8 SDs, 0 SdLazy, 10 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital29 mio100 ax100 hnf100 lsp79 ukn92 mio100 lsp100 div197 bol100 ite100 ukn100 eq142 hnf73 smp90 dnf131 smp93 tf107 neg99 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...