./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/terminator_02-2.c --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/loops/terminator_02-2.c -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 65ab588eb3fe519c96bb6d6dcdb0a8fd90c1757c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:06:08,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:06:08,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:06:08,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:06:08,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:06:08,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:06:08,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:06:08,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:06:08,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:06:08,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:06:08,499 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:06:08,500 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:06:08,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:06:08,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:06:08,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:06:08,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:06:08,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:06:08,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:06:08,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:06:08,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:06:08,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:06:08,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:06:08,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:06:08,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:06:08,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:06:08,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:06:08,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:06:08,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:06:08,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:06:08,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:06:08,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:06:08,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:06:08,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:06:08,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:06:08,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:06:08,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:06:08,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:06:08,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:06:08,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:06:08,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:06:08,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:06:08,544 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:06:08,571 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:06:08,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:06:08,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:06:08,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:06:08,573 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:06:08,573 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:06:08,574 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:06:08,574 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:06:08,574 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:06:08,574 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:06:08,575 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:06:08,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:06:08,575 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:06:08,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:06:08,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:06:08,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:06:08,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:06:08,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:06:08,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:06:08,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:06:08,577 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:06:08,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:06:08,578 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:06:08,578 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:06:08,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:06:08,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:06:08,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:06:08,579 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:06:08,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:06:08,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:06:08,580 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:06:08,580 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:06:08,581 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:06:08,582 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 -> 65ab588eb3fe519c96bb6d6dcdb0a8fd90c1757c [2020-07-29 02:06:08,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:06:08,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:06:08,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:06:08,874 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:06:08,875 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:06:08,876 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/terminator_02-2.c [2020-07-29 02:06:08,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3c918cc/316f9793ce2f41a6a035d90bdb4a8d40/FLAG92d2c047a [2020-07-29 02:06:09,356 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:06:09,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/terminator_02-2.c [2020-07-29 02:06:09,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3c918cc/316f9793ce2f41a6a035d90bdb4a8d40/FLAG92d2c047a [2020-07-29 02:06:09,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b3c918cc/316f9793ce2f41a6a035d90bdb4a8d40 [2020-07-29 02:06:09,758 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:06:09,762 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:06:09,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:06:09,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:06:09,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:06:09,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:06:09" (1/1) ... [2020-07-29 02:06:09,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f5f43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:09, skipping insertion in model container [2020-07-29 02:06:09,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:06:09" (1/1) ... [2020-07-29 02:06:09,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:06:09,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:06:10,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:06:10,025 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:06:10,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:06:10,059 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:06:10,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10 WrapperNode [2020-07-29 02:06:10,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:06:10,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:06:10,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:06:10,061 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:06:10,069 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:06:10" (1/1) ... [2020-07-29 02:06:10,073 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:06:10" (1/1) ... [2020-07-29 02:06:10,152 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:06:10,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:06:10,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:06:10,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:06:10,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (1/1) ... [2020-07-29 02:06:10,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (1/1) ... [2020-07-29 02:06:10,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (1/1) ... [2020-07-29 02:06:10,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (1/1) ... [2020-07-29 02:06:10,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (1/1) ... [2020-07-29 02:06:10,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (1/1) ... [2020-07-29 02:06:10,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (1/1) ... [2020-07-29 02:06:10,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:06:10,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:06:10,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:06:10,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:06:10,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (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:06:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:06:10,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:06:10,545 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:06:10,546 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 02:06:10,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:06:10 BoogieIcfgContainer [2020-07-29 02:06:10,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:06:10,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:06:10,562 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:06:10,565 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:06:10,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:06:10,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:06:09" (1/3) ... [2020-07-29 02:06:10,568 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2abb9afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:06:10, skipping insertion in model container [2020-07-29 02:06:10,568 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:06:10,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:06:10" (2/3) ... [2020-07-29 02:06:10,573 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2abb9afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:06:10, skipping insertion in model container [2020-07-29 02:06:10,573 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:06:10,573 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:06:10" (3/3) ... [2020-07-29 02:06:10,575 INFO L371 chiAutomizerObserver]: Analyzing ICFG terminator_02-2.c [2020-07-29 02:06:10,618 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:06:10,618 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:06:10,618 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:06:10,618 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:06:10,618 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:06:10,619 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:06:10,619 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:06:10,619 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:06:10,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 02:06:10,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:10,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:10,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:10,658 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 02:06:10,658 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:06:10,658 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:06:10,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 02:06:10,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:10,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:10,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:10,663 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 02:06:10,663 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:06:10,669 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; 8#L20true assume !!(main_~x~0 > -100); 9#L21true assume !!(main_~x~0 < 200); 11#L22true assume !!(main_~z~0 > 100); 14#L23true assume !!(main_~z~0 < 200); 16#L27-2true [2020-07-29 02:06:10,670 INFO L796 eck$LassoCheckResult]: Loop: 16#L27-2true assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; 4#L27true assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3; 16#L27-2true [2020-07-29 02:06:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:10,675 INFO L82 PathProgramCache]: Analyzing trace with hash 29742506, now seen corresponding path program 1 times [2020-07-29 02:06:10,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:10,683 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882448131] [2020-07-29 02:06:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:10,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:10,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:10,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:10,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:10,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1924, now seen corresponding path program 1 times [2020-07-29 02:06:10,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:10,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731891262] [2020-07-29 02:06:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:10,792 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:10,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:10,800 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1482221843, now seen corresponding path program 1 times [2020-07-29 02:06:10,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:10,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948526750] [2020-07-29 02:06:10,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:10,813 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:10,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:10,824 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:10,901 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:06:10,902 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:06:10,902 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:06:10,903 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:06:10,903 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:06:10,903 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:10,903 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:06:10,904 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:06:10,904 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration1_Loop [2020-07-29 02:06:10,904 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:06:10,904 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:06:10,935 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:06:10,951 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:06:10,957 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:06:10,962 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:06:11,156 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:06:11,157 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:11,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:11,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:06:11,183 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:11,183 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=41, ULTIMATE.start_main_~tmp~0=41} Honda state: {ULTIMATE.start_main_#t~nondet2=41, ULTIMATE.start_main_~tmp~0=41} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:11,222 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:11,222 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:11,227 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:11,227 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0=101} Honda state: {ULTIMATE.start_main_~z~0=101} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:11,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:11,267 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:11,271 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:11,272 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=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:06:11,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:11,308 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:06:11,348 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:06:11,348 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:06:11,386 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:06:11,389 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:06:11,391 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:06:11,391 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:06:11,392 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:06:11,392 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:06:11,392 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:11,392 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:06:11,392 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:06:11,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration1_Loop [2020-07-29 02:06:11,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:06:11,393 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:06:11,402 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:06:11,414 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:06:11,421 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:06:11,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:06:11,628 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:06:11,634 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:06:11,648 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:06:11,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:11,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:11,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:11,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:11,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:11,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:11,666 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:06:11,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:11,716 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:06:11,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:11,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:11,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:11,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:11,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:11,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:11,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:11,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:11,764 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:06:11,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:11,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:11,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:11,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:11,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:11,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:11,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:11,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:11,806 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:06:11,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:11,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:11,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:11,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:11,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:11,810 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:11,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:11,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:06:11,819 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:06:11,819 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:11,835 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:06:11,836 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:06:11,836 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:06:11,837 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 199 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:11,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:06:11,870 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2;" "assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3;" [2020-07-29 02:06:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:11,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:11,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:06:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:11,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:11,934 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; {24#unseeded} is VALID [2020-07-29 02:06:11,935 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#unseeded} assume !!(main_~x~0 > -100); {24#unseeded} is VALID [2020-07-29 02:06:11,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#unseeded} assume !!(main_~x~0 < 200); {24#unseeded} is VALID [2020-07-29 02:06:11,937 INFO L280 TraceCheckUtils]: 3: Hoare triple {24#unseeded} assume !!(main_~z~0 > 100); {24#unseeded} is VALID [2020-07-29 02:06:11,938 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#unseeded} assume !!(main_~z~0 < 200); {24#unseeded} is VALID [2020-07-29 02:06:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:11,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:06:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:11,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:11,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199))} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {54#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} is VALID [2020-07-29 02:06:11,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3; {37#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:06:11,972 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:06:11,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:06:11,996 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:06:11,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:12,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,008 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:06:12,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2020-07-29 02:06:12,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 42 states and 55 transitions. Complement of second has 8 states. [2020-07-29 02:06:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:06:12,127 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:12,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2020-07-29 02:06:12,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:12,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:12,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:12,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:06:12,135 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 02:06:12,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:12,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:12,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2020-07-29 02:06:12,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:12,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:12,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:12,142 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states. [2020-07-29 02:06:12,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:12,145 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:12,146 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:06:12,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 02:06:12,150 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:12,150 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 55 transitions. cyclomatic complexity: 15 [2020-07-29 02:06:12,151 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:12,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:12,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:12,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:12,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:12,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:12,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:12,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 02:06:12,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 02:06:12,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 42 letters. Loop has 42 letters. [2020-07-29 02:06:12,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 02:06:12,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 02:06:12,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 14 letters. [2020-07-29 02:06:12,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:06:12,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:06:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:06:12,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:12,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:12,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:12,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:06:12,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:06:12,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:06:12,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:06:12,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:06:12,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:06:12,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:12,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:12,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:12,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:12,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:12,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:12,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:06:12,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:06:12,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 55 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:06:12,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,173 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:06:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2020-07-29 02:06:12,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:12,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:12,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:06:12,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:12,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 55 transitions. cyclomatic complexity: 15 [2020-07-29 02:06:12,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:12,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 11 states and 14 transitions. [2020-07-29 02:06:12,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 02:06:12,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 02:06:12,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 02:06:12,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:06:12,195 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 02:06:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 02:06:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 02:06:12,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:06:12,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 02:06:12,230 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 02:06:12,233 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 11 states. [2020-07-29 02:06:12,237 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:06:12,241 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 02:06:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 02:06:12,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:06:12,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:06:12,243 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 02:06:12,243 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 14 transitions. [2020-07-29 02:06:12,246 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:06:12,254 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 02:06:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 02:06:12,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:06:12,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:06:12,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:06:12,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:06:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 02:06:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2020-07-29 02:06:12,259 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 02:06:12,260 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 02:06:12,260 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:06:12,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 02:06:12,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:12,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:12,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:12,262 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:06:12,262 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:06:12,263 INFO L794 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; 114#L20 assume !!(main_~x~0 > -100); 111#L21 assume !!(main_~x~0 < 200); 112#L22 assume !!(main_~z~0 > 100); 119#L23 assume !!(main_~z~0 < 200); 120#L27-2 assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; 115#L27 assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; 116#L27-2 [2020-07-29 02:06:12,263 INFO L796 eck$LassoCheckResult]: Loop: 116#L27-2 assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; 121#L27 assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3; 116#L27-2 [2020-07-29 02:06:12,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1482221841, now seen corresponding path program 1 times [2020-07-29 02:06:12,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:12,265 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214142685] [2020-07-29 02:06:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:12,288 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:12,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:12,309 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:12,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:12,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1924, now seen corresponding path program 2 times [2020-07-29 02:06:12,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:12,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25505169] [2020-07-29 02:06:12,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:12,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:12,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:12,335 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:12,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:12,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1513954034, now seen corresponding path program 1 times [2020-07-29 02:06:12,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:12,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216982808] [2020-07-29 02:06:12,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:12,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:12,357 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:12,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:12,393 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:06:12,394 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:06:12,394 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:06:12,394 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:06:12,394 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:06:12,395 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:12,395 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:06:12,395 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:06:12,395 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration2_Loop [2020-07-29 02:06:12,395 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:06:12,395 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:06:12,403 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:06:12,408 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:06:12,413 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:06:12,421 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:06:12,573 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:06:12,573 INFO L404 LassoAnalysis]: Checking for nontermination... 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:06:12,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:12,578 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:06:12,582 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:12,583 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post3=0} Honda state: {ULTIMATE.start_main_#t~post3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:06:12,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:12,631 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:12,635 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:12,635 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0=101} Honda state: {ULTIMATE.start_main_~z~0=101} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:12,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:12,680 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:12,693 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:12,693 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=-136, ULTIMATE.start_main_~tmp~0=-136} Honda state: {ULTIMATE.start_main_#t~nondet2=-136, ULTIMATE.start_main_~tmp~0=-136} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:12,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:12,738 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:12,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:06:12,787 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:12,826 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:06:12,829 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:06:12,829 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:06:12,829 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:06:12,829 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:06:12,830 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:06:12,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:12,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:06:12,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:06:12,830 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration2_Loop [2020-07-29 02:06:12,830 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:06:12,830 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:06:12,837 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:06:12,842 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:06:12,846 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:06:12,854 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:06:13,006 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:06:13,007 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:13,018 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:06:13,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:13,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:13,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:13,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:13,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:13,022 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:13,022 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,024 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,046 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:06:13,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:13,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:13,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:13,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:13,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:13,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:13,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:13,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,075 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:06:13,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:13,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:13,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:13,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:13,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:13,084 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:13,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:13,087 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,112 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:06:13,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:13,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:13,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:13,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:13,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:13,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:13,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:13,122 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:06:13,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:06:13,126 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:06:13,149 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:06:13,149 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:06:13,149 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 199 Supporting invariants [] [2020-07-29 02:06:13,182 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:06:13,192 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2;" "assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3;" [2020-07-29 02:06:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:06:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:13,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {189#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; {189#unseeded} is VALID [2020-07-29 02:06:13,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {189#unseeded} assume !!(main_~x~0 > -100); {189#unseeded} is VALID [2020-07-29 02:06:13,231 INFO L280 TraceCheckUtils]: 2: Hoare triple {189#unseeded} assume !!(main_~x~0 < 200); {189#unseeded} is VALID [2020-07-29 02:06:13,232 INFO L280 TraceCheckUtils]: 3: Hoare triple {189#unseeded} assume !!(main_~z~0 > 100); {189#unseeded} is VALID [2020-07-29 02:06:13,233 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#unseeded} assume !!(main_~z~0 < 200); {189#unseeded} is VALID [2020-07-29 02:06:13,234 INFO L280 TraceCheckUtils]: 5: Hoare triple {189#unseeded} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {189#unseeded} is VALID [2020-07-29 02:06:13,234 INFO L280 TraceCheckUtils]: 6: Hoare triple {189#unseeded} assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; {189#unseeded} is VALID [2020-07-29 02:06:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:06:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:13,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {192#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199))} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {225#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} is VALID [2020-07-29 02:06:13,263 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3; {202#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:06:13,263 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:06:13,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:06:13,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:06:13,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:13,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,272 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:06:13,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 02:06:13,300 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 15 states and 20 transitions. Complement of second has 5 states. [2020-07-29 02:06:13,300 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:06:13,301 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:13,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 02:06:13,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:13,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:13,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:06:13,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:13,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:13,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:13,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 02:06:13,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:13,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:13,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:13,304 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 02:06:13,305 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:13,305 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:06:13,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:13,306 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:06:13,306 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:13,307 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:13,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:13,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:13,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:13,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,308 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:06:13,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:13,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:13,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:13,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:13,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:13,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:13,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:13,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:13,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,312 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:06:13,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:06:13,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:06:13,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,313 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:06:13,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:13,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:13,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:13,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:13,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:06:13,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:06:13,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:06:13,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,317 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:06:13,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:13,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:13,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:13,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:13,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:13,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:13,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:13,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:13,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,321 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:13,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:06:13,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 02:06:13,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:13,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:13,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 02:06:13,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:13,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:13,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:13,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 02:06:13,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 02:06:13,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 02:06:13,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-29 02:06:13,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:06:13,326 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 02:06:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-29 02:06:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 02:06:13,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:06:13,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 02:06:13,328 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 02:06:13,328 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 02:06:13,328 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:06:13,330 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 02:06:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 02:06:13,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:06:13,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:06:13,330 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 02:06:13,331 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 02:06:13,331 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:06:13,332 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 02:06:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 02:06:13,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:06:13,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:06:13,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:06:13,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:06:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 02:06:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 02:06:13,334 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 02:06:13,335 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 02:06:13,335 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:06:13,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 02:06:13,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:13,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:13,335 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:13,336 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-07-29 02:06:13,336 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:06:13,336 INFO L794 eck$LassoCheckResult]: Stem: 253#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; 254#L20 assume !!(main_~x~0 > -100); 251#L21 assume !!(main_~x~0 < 200); 252#L22 assume !!(main_~z~0 > 100); 259#L23 assume !!(main_~z~0 < 200); 260#L27-2 assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; 263#L27 assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; 262#L27-2 assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; 255#L27 assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; 256#L27-2 [2020-07-29 02:06:13,336 INFO L796 eck$LassoCheckResult]: Loop: 256#L27-2 assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; 261#L27 assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3; 256#L27-2 [2020-07-29 02:06:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:13,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1513954036, now seen corresponding path program 2 times [2020-07-29 02:06:13,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:13,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548331873] [2020-07-29 02:06:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:13,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:13,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:13,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:13,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1924, now seen corresponding path program 3 times [2020-07-29 02:06:13,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:13,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343514187] [2020-07-29 02:06:13,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:13,361 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:13,364 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:13,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:13,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1084083785, now seen corresponding path program 2 times [2020-07-29 02:06:13,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:13,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205595576] [2020-07-29 02:06:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:13,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:13,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:13,397 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:13,438 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:06:13,438 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:06:13,438 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:06:13,438 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:06:13,438 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:06:13,438 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,438 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:06:13,439 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:06:13,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration3_Loop [2020-07-29 02:06:13,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:06:13,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:06:13,444 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:06:13,450 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:06:13,458 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:06:13,468 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:06:13,611 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:06:13,611 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:13,615 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:06:13,617 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:13,618 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~z~0=101} Honda state: {ULTIMATE.start_main_~z~0=101} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:13,643 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,670 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:06:13,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:06:13,694 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:06:13,695 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:06:13,695 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:06:13,695 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:06:13,695 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:06:13,695 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:06:13,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,696 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:06:13,696 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:06:13,696 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration3_Loop [2020-07-29 02:06:13,696 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:06:13,696 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:06:13,705 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:06:13,711 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:06:13,717 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:06:13,721 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:06:13,870 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:06:13,870 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,877 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:06:13,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:13,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:13,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:13,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:13,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:13,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:13,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:13,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,902 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:06:13,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:13,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:13,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:13,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:13,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:13,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:13,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:13,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:06:13,909 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:06:13,909 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:13,911 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:06:13,911 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:06:13,911 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:06:13,911 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 199 Supporting invariants [] [2020-07-29 02:06:13,933 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:06:13,936 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2;" "assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3;" [2020-07-29 02:06:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:06:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:13,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {347#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; {347#unseeded} is VALID [2020-07-29 02:06:13,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {347#unseeded} assume !!(main_~x~0 > -100); {347#unseeded} is VALID [2020-07-29 02:06:13,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {347#unseeded} assume !!(main_~x~0 < 200); {347#unseeded} is VALID [2020-07-29 02:06:13,977 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#unseeded} assume !!(main_~z~0 > 100); {347#unseeded} is VALID [2020-07-29 02:06:13,978 INFO L280 TraceCheckUtils]: 4: Hoare triple {347#unseeded} assume !!(main_~z~0 < 200); {347#unseeded} is VALID [2020-07-29 02:06:13,978 INFO L280 TraceCheckUtils]: 5: Hoare triple {347#unseeded} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {347#unseeded} is VALID [2020-07-29 02:06:13,979 INFO L280 TraceCheckUtils]: 6: Hoare triple {347#unseeded} assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; {347#unseeded} is VALID [2020-07-29 02:06:13,979 INFO L280 TraceCheckUtils]: 7: Hoare triple {347#unseeded} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {347#unseeded} is VALID [2020-07-29 02:06:13,980 INFO L280 TraceCheckUtils]: 8: Hoare triple {347#unseeded} assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; {347#unseeded} is VALID [2020-07-29 02:06:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:06:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:13,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:14,010 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199))} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {389#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} is VALID [2020-07-29 02:06:14,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {389#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3; {360#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:06:14,012 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:06:14,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:06:14,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:06:14,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,021 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:06:14,021 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 02:06:14,054 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 17 states and 24 transitions. Complement of second has 5 states. [2020-07-29 02:06:14,054 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:06:14,054 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:14,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:14,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:06:14,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:14,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-07-29 02:06:14,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:14,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,057 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:14,057 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:14,057 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:06:14,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:14,059 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:06:14,059 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2020-07-29 02:06:14,059 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:14,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:06:14,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:06:14,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:06:14,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,072 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:06:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 02:06:14,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,074 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:06:14,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:14,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:06:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:14,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:14,108 INFO L280 TraceCheckUtils]: 0: Hoare triple {347#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; {347#unseeded} is VALID [2020-07-29 02:06:14,109 INFO L280 TraceCheckUtils]: 1: Hoare triple {347#unseeded} assume !!(main_~x~0 > -100); {347#unseeded} is VALID [2020-07-29 02:06:14,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {347#unseeded} assume !!(main_~x~0 < 200); {347#unseeded} is VALID [2020-07-29 02:06:14,111 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#unseeded} assume !!(main_~z~0 > 100); {347#unseeded} is VALID [2020-07-29 02:06:14,111 INFO L280 TraceCheckUtils]: 4: Hoare triple {347#unseeded} assume !!(main_~z~0 < 200); {347#unseeded} is VALID [2020-07-29 02:06:14,112 INFO L280 TraceCheckUtils]: 5: Hoare triple {347#unseeded} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {347#unseeded} is VALID [2020-07-29 02:06:14,112 INFO L280 TraceCheckUtils]: 6: Hoare triple {347#unseeded} assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; {347#unseeded} is VALID [2020-07-29 02:06:14,113 INFO L280 TraceCheckUtils]: 7: Hoare triple {347#unseeded} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {347#unseeded} is VALID [2020-07-29 02:06:14,113 INFO L280 TraceCheckUtils]: 8: Hoare triple {347#unseeded} assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; {347#unseeded} is VALID [2020-07-29 02:06:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:14,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:06:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:14,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:14,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199))} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {445#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} is VALID [2020-07-29 02:06:14,149 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3; {360#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:06:14,150 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:06:14,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:06:14,158 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:06:14,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,159 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 02:06:14,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 02:06:14,188 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 17 states and 24 transitions. Complement of second has 5 states. [2020-07-29 02:06:14,188 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:06:14,188 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:14,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:14,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:06:14,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:14,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-07-29 02:06:14,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:14,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,192 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:14,192 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:14,192 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:06:14,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:14,193 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:06:14,193 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 10 [2020-07-29 02:06:14,194 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:14,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:06:14,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:06:14,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:06:14,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,206 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:06:14,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 02:06:14,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,208 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:06:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:14,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:06:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:14,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:14,236 INFO L280 TraceCheckUtils]: 0: Hoare triple {347#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; {347#unseeded} is VALID [2020-07-29 02:06:14,237 INFO L280 TraceCheckUtils]: 1: Hoare triple {347#unseeded} assume !!(main_~x~0 > -100); {347#unseeded} is VALID [2020-07-29 02:06:14,237 INFO L280 TraceCheckUtils]: 2: Hoare triple {347#unseeded} assume !!(main_~x~0 < 200); {347#unseeded} is VALID [2020-07-29 02:06:14,238 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#unseeded} assume !!(main_~z~0 > 100); {347#unseeded} is VALID [2020-07-29 02:06:14,238 INFO L280 TraceCheckUtils]: 4: Hoare triple {347#unseeded} assume !!(main_~z~0 < 200); {347#unseeded} is VALID [2020-07-29 02:06:14,239 INFO L280 TraceCheckUtils]: 5: Hoare triple {347#unseeded} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {347#unseeded} is VALID [2020-07-29 02:06:14,239 INFO L280 TraceCheckUtils]: 6: Hoare triple {347#unseeded} assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; {347#unseeded} is VALID [2020-07-29 02:06:14,240 INFO L280 TraceCheckUtils]: 7: Hoare triple {347#unseeded} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {347#unseeded} is VALID [2020-07-29 02:06:14,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {347#unseeded} assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; {347#unseeded} is VALID [2020-07-29 02:06:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:14,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:06:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:14,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:14,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {350#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199))} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {501#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} is VALID [2020-07-29 02:06:14,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {501#(and (<= 199 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 100))} assume 0 != main_~tmp~0 % 256;main_#t~post3 := main_~x~0;main_~x~0 := 1 + main_#t~post3;havoc main_#t~post3; {360#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 199)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:06:14,264 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:06:14,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:06:14,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:06:14,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,272 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 02:06:14,272 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 02:06:14,308 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 19 states and 27 transitions. Complement of second has 4 states. [2020-07-29 02:06:14,309 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:06:14,309 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:14,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:14,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:06:14,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:14,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 27 transitions. [2020-07-29 02:06:14,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:06:14,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,312 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:14,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:14,312 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:06:14,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:14,313 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:06:14,313 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 27 transitions. cyclomatic complexity: 11 [2020-07-29 02:06:14,313 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:06:14,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:06:14,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:06:14,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:06:14,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:14,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:14,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:06:14,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:14,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 27 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,325 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:06:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2020-07-29 02:06:14,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:06:14,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 02:06:14,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:06:14,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:14,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 27 transitions. cyclomatic complexity: 11 [2020-07-29 02:06:14,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:06:14,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 23 transitions. [2020-07-29 02:06:14,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 02:06:14,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 02:06:14,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2020-07-29 02:06:14,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:06:14,329 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 02:06:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2020-07-29 02:06:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 9. [2020-07-29 02:06:14,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:06:14,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 23 transitions. Second operand 9 states. [2020-07-29 02:06:14,331 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 23 transitions. Second operand 9 states. [2020-07-29 02:06:14,331 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand 9 states. [2020-07-29 02:06:14,331 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:06:14,332 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 02:06:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-29 02:06:14,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:06:14,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:06:14,333 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 17 states and 23 transitions. [2020-07-29 02:06:14,333 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 17 states and 23 transitions. [2020-07-29 02:06:14,333 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:06:14,335 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2020-07-29 02:06:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2020-07-29 02:06:14,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:06:14,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:06:14,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:06:14,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:06:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 02:06:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2020-07-29 02:06:14,336 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 02:06:14,336 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2020-07-29 02:06:14,336 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 02:06:14,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2020-07-29 02:06:14,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:06:14,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:14,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:14,337 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 02:06:14,337 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:06:14,337 INFO L794 eck$LassoCheckResult]: Stem: 532#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; 533#L20 assume !!(main_~x~0 > -100); 530#L21 assume !!(main_~x~0 < 200); 531#L22 assume !!(main_~z~0 > 100); 538#L23 assume !!(main_~z~0 < 200); 535#L27-2 [2020-07-29 02:06:14,337 INFO L796 eck$LassoCheckResult]: Loop: 535#L27-2 assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; 534#L27 assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; 535#L27-2 [2020-07-29 02:06:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash 29742506, now seen corresponding path program 2 times [2020-07-29 02:06:14,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:14,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73312245] [2020-07-29 02:06:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:14,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:14,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:14,345 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1926, now seen corresponding path program 1 times [2020-07-29 02:06:14,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:14,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095262515] [2020-07-29 02:06:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:14,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:14,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:14,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1482221841, now seen corresponding path program 3 times [2020-07-29 02:06:14,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:06:14,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847299161] [2020-07-29 02:06:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:06:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:14,359 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:06:14,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:06:14,373 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:06:14,412 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:06:14,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:06:14,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:06:14,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:06:14,412 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:06:14,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,413 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:06:14,413 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:06:14,413 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration4_Loop [2020-07-29 02:06:14,413 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:06:14,413 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:06:14,418 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:06:14,425 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:06:14,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:06:14,435 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:06:14,443 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:06:14,607 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:06:14,607 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,610 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:14,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:06:14,619 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:14,619 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0, ULTIMATE.start_main_~tmp~0=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0, ULTIMATE.start_main_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,641 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:14,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:06:14,644 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:06:14,644 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:06:14,667 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,694 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:06:14,694 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:06:14,721 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:06:14,722 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:06:14,722 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:06:14,722 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:06:14,722 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:06:14,723 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:06:14,723 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,723 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:06:14,723 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:06:14,723 INFO L133 ssoRankerPreferences]: Filename of dumped script: terminator_02-2.c_Iteration4_Loop [2020-07-29 02:06:14,723 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:06:14,723 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:06:14,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:06:14,738 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:06:14,743 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:06:14,749 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:06:14,756 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:06:14,909 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:06:14,910 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:14,916 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:06:14,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:14,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:14,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:14,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:14,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:14,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:14,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:14,965 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:06:14,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:14,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:14,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:14,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:14,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:14,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:14,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:06:14,995 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:14,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:06:14,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:06:14,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:06:14,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:06:14,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:06:14,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:06:14,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:06:15,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:06:15,003 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:06:15,003 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:06:15,006 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:06:15,006 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:06:15,006 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:06:15,006 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~z~0) = 1*ULTIMATE.start_main_~z~0 Supporting invariants [] [2020-07-29 02:06:15,027 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:06:15,029 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2;" "assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5;" [2020-07-29 02:06:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:15,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:06:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:15,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:06:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:15,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:15,064 INFO L280 TraceCheckUtils]: 0: Hoare triple {620#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~post3, main_#t~post4, main_#t~post5, main_~tmp~0, main_~x~0, main_~z~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~z~0 := main_#t~nondet1;havoc main_#t~nondet1; {620#unseeded} is VALID [2020-07-29 02:06:15,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {620#unseeded} assume !!(main_~x~0 > -100); {620#unseeded} is VALID [2020-07-29 02:06:15,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#unseeded} assume !!(main_~x~0 < 200); {620#unseeded} is VALID [2020-07-29 02:06:15,070 INFO L280 TraceCheckUtils]: 3: Hoare triple {620#unseeded} assume !!(main_~z~0 > 100); {620#unseeded} is VALID [2020-07-29 02:06:15,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {620#unseeded} assume !!(main_~z~0 < 200); {620#unseeded} is VALID [2020-07-29 02:06:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:15,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:06:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:06:15,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:06:15,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {623#(>= oldRank0 ULTIMATE.start_main_~z~0)} assume !!(main_~x~0 < 100 && main_~z~0 > 100);main_~tmp~0 := main_#t~nondet2;havoc main_#t~nondet2; {650#(and (< 100 ULTIMATE.start_main_~z~0) (<= ULTIMATE.start_main_~z~0 oldRank0))} is VALID [2020-07-29 02:06:15,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {650#(and (< 100 ULTIMATE.start_main_~z~0) (<= ULTIMATE.start_main_~z~0 oldRank0))} assume !(0 != main_~tmp~0 % 256);main_#t~post4 := main_~x~0;main_~x~0 := main_#t~post4 - 1;havoc main_#t~post4;main_#t~post5 := main_~z~0;main_~z~0 := main_#t~post5 - 1;havoc main_#t~post5; {633#(or (and (> oldRank0 ULTIMATE.start_main_~z~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 02:06:15,099 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:06:15,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:06:15,105 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:06:15,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:15,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,106 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:06:15,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 02:06:15,136 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 11 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 15 states and 21 transitions. Complement of second has 4 states. [2020-07-29 02:06:15,136 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:06:15,137 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:15,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. cyclomatic complexity: 3 [2020-07-29 02:06:15,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:15,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:15,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:06:15,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:15,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:06:15,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:06:15,138 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2020-07-29 02:06:15,139 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:06:15,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:06:15,139 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 11 transitions. cyclomatic complexity: 3 [2020-07-29 02:06:15,139 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:06:15,139 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:06:15,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:06:15,140 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:06:15,140 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:15,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:15,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:06:15,141 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:06:15,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:15,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:15,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:15,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:15,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:15,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:15,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:15,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:15,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:06:15,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2020-07-29 02:06:15,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 02:06:15,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2020-07-29 02:06:15,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:15,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:15,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:06:15,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:06:15,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:06:15,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:06:15,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:15,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:15,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:15,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 11 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:15,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:15,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:06:15,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,148 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:06:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:06:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 02:06:15,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:06:15,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:06:15,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 02:06:15,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:06:15,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2020-07-29 02:06:15,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:06:15,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2020-07-29 02:06:15,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:06:15,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:06:15,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:06:15,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:06:15,151 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:06:15,151 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:06:15,151 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:06:15,151 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 02:06:15,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 02:06:15,152 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:06:15,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:06:15,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:06:15 BoogieIcfgContainer [2020-07-29 02:06:15,159 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:06:15,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:06:15,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:06:15,159 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:06:15,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:06:10" (3/4) ... [2020-07-29 02:06:15,163 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 02:06:15,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:06:15,167 INFO L168 Benchmark]: Toolchain (without parser) took 5406.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 956.2 MB in the beginning and 873.7 MB in the end (delta: 82.5 MB). Peak memory consumption was 297.9 MB. Max. memory is 11.5 GB. [2020-07-29 02:06:15,167 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:06:15,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.46 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 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:06:15,169 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 02:06:15,169 INFO L168 Benchmark]: Boogie Preprocessor took 24.78 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:06:15,170 INFO L168 Benchmark]: RCFGBuilder took 383.60 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:06:15,171 INFO L168 Benchmark]: BuchiAutomizer took 4596.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 873.7 MB in the end (delta: 243.2 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. [2020-07-29 02:06:15,172 INFO L168 Benchmark]: Witness Printer took 4.53 ms. Allocated memory is still 1.2 GB. Free memory is still 873.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:06:15,176 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.46 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 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 91.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.78 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 383.60 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4596.79 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 873.7 MB in the end (delta: 243.2 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.53 ms. Allocated memory is still 1.2 GB. Free memory is still 873.7 MB. 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 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x + 199 and consists of 5 locations. One deterministic module has affine ranking function -2 * x + 199 and consists of 3 locations. One deterministic module has affine ranking function z and consists of 3 locations. One nondeterministic module has affine ranking function -2 * x + 199 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 54 SDtfs, 59 SDslu, 11 SDs, 0 SdLazy, 43 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp47 ukn100 mio100 lsp100 div444 bol100 ite100 ukn100 eq150 hnf48 smp82 dnf100 smp100 tf106 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...