./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/c.01-no-inv.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/c.01-no-inv.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 90c8922c67b3eb8c55716b63a408098d1b23a21e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:31:30,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:31:30,916 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:31:30,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:31:30,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:31:30,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:31:30,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:31:30,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:31:30,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:31:30,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:31:30,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:31:30,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:31:30,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:31:30,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:31:30,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:31:30,969 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:31:30,970 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:31:30,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:31:30,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:31:30,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:31:30,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:31:30,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:31:30,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:31:30,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:31:30,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:31:30,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:31:30,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:31:30,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:31:30,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:31:30,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:31:30,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:31:30,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:31:30,997 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:31:30,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:31:30,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:31:31,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:31:31,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:31:31,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:31:31,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:31:31,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:31:31,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:31:31,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:31:31,020 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:31:31,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:31:31,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:31:31,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:31:31,023 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:31:31,023 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:31:31,023 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:31:31,024 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:31:31,024 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:31:31,024 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:31:31,024 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:31:31,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:31:31,025 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:31:31,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:31:31,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:31:31,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:31:31,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:31:31,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:31:31,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:31:31,027 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:31:31,027 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:31:31,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:31:31,028 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:31:31,028 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:31:31,028 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:31:31,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:31:31,029 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:31:31,029 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:31:31,029 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:31:31,030 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:31:31,031 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90c8922c67b3eb8c55716b63a408098d1b23a21e [2020-07-29 01:31:31,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:31:31,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:31:31,405 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:31:31,408 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:31:31,409 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:31:31,410 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/c.01-no-inv.c [2020-07-29 01:31:31,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e962460/46a864f11f4f45c4a457fc439ea41643/FLAG2649070ab [2020-07-29 01:31:31,892 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:31:31,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/c.01-no-inv.c [2020-07-29 01:31:31,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e962460/46a864f11f4f45c4a457fc439ea41643/FLAG2649070ab [2020-07-29 01:31:32,305 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76e962460/46a864f11f4f45c4a457fc439ea41643 [2020-07-29 01:31:32,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:31:32,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:31:32,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:31:32,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:31:32,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:31:32,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3f06fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32, skipping insertion in model container [2020-07-29 01:31:32,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:31:32,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:31:32,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:31:32,563 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:31:32,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:31:32,596 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:31:32,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32 WrapperNode [2020-07-29 01:31:32,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:31:32,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:31:32,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:31:32,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:31:32,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:31:32,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:31:32,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:31:32,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:31:32,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... [2020-07-29 01:31:32,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:31:32,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:31:32,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:31:32,714 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:31:32,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:32,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:31:32,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:31:32,959 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:31:32,960 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:31:32,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:32 BoogieIcfgContainer [2020-07-29 01:31:32,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:31:32,964 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:31:32,964 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:31:32,968 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:31:32,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:32,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:31:32" (1/3) ... [2020-07-29 01:31:32,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19209234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:31:32, skipping insertion in model container [2020-07-29 01:31:32,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:32,971 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:32" (2/3) ... [2020-07-29 01:31:32,971 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19209234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:31:32, skipping insertion in model container [2020-07-29 01:31:32,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:32,972 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:32" (3/3) ... [2020-07-29 01:31:32,973 INFO L371 chiAutomizerObserver]: Analyzing ICFG c.01-no-inv.c [2020-07-29 01:31:33,032 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:31:33,032 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:31:33,032 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:31:33,032 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:31:33,033 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:31:33,033 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:31:33,033 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:31:33,033 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:31:33,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:31:33,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:33,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:33,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:33,107 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:33,107 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:31:33,108 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:31:33,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:31:33,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:33,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:33,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:33,112 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:33,112 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:31:33,123 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 8#L10-2true [2020-07-29 01:31:33,123 INFO L796 eck$LassoCheckResult]: Loop: 8#L10-2true assume !!(main_~x~0 >= 0);main_~y~0 := 1; 3#L12-2true assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); 10#L12-3true main_~x~0 := main_~x~0 - 1; 8#L10-2true [2020-07-29 01:31:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:33,131 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:31:33,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:33,155 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081022391] [2020-07-29 01:31:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:33,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:33,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:33,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:33,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:33,269 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:31:33,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:33,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987185901] [2020-07-29 01:31:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:33,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:33,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:33,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:33,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2020-07-29 01:31:33,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:33,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353657666] [2020-07-29 01:31:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:33,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:33,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:33,322 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:33,414 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:33,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:33,415 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:33,415 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:33,416 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:33,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:33,416 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:33,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:33,417 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv.c_Iteration1_Loop [2020-07-29 01:31:33,417 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:33,417 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:33,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 01:31:33,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:33,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:33,654 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:33,655 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:33,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:33,662 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:33,672 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:33,672 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} 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 01:31:33,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:33,712 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 01:31:33,716 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:33,717 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} 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 01:31:33,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:33,757 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:33,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:33,814 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:33,865 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:33,868 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:33,868 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:33,868 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:33,868 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:33,869 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:33,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:33,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:33,870 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:33,870 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv.c_Iteration1_Loop [2020-07-29 01:31:33,870 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:33,870 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:33,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:33,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:33,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:34,060 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:34,066 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:34,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:34,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:34,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:34,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:34,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:34,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:34,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:34,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:34,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:34,097 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:34,097 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:34,101 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:34,101 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:34,102 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:34,103 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 2*ULTIMATE.start_main_~x~0 + 1 Supporting invariants [] [2020-07-29 01:31:34,136 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:34,141 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 >= 0);main_~y~0 := 1;" "assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);" "main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:31:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:34,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:34,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:34,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {18#unseeded} is VALID [2020-07-29 01:31:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:34,220 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:34,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:34,260 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~x~0) 1))} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {36#(and (<= (+ (* 2 ULTIMATE.start_main_~x~0) 1) oldRank0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:31:34,261 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(and (<= (+ (* 2 ULTIMATE.start_main_~x~0) 1) oldRank0) (<= 0 ULTIMATE.start_main_~x~0))} assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); {36#(and (<= (+ (* 2 ULTIMATE.start_main_~x~0) 1) oldRank0) (<= 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:31:34,263 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#(and (<= (+ (* 2 ULTIMATE.start_main_~x~0) 1) oldRank0) (<= 0 ULTIMATE.start_main_~x~0))} main_~x~0 := main_~x~0 - 1; {31#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~x~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:31:34,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 01:31:34,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:34,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:34,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:34,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,299 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:31:34,301 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2020-07-29 01:31:34,428 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 23 states and 35 transitions. Complement of second has 7 states. [2020-07-29 01:31:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:34,430 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:34,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:31:34,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:34,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:34,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:34,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:34,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:31:34,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:34,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:34,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-07-29 01:31:34,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:34,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:34,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:34,450 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:31:34,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:34,454 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:31:34,455 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:34,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:31:34,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:31:34,463 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 01:31:34,464 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:34,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:34,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:34,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:34,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:34,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:34,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:34,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:34,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:34,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:34,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:31:34,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:31:34,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:31:34,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:34,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:34,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:34,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:34,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:34,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:31:34,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:34,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:34,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:34,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:34,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:34,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:34,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:34,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:34,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:34,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:34,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:34,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:34,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:34,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:34,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:34,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:34,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:34,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 35 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:34,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,494 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:34,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 01:31:34,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:31:34,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:31:34,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:31:34,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:34,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 01:31:34,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:34,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2020-07-29 01:31:34,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:31:34,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:31:34,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-29 01:31:34,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:34,537 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:31:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-29 01:31:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-29 01:31:34,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:34,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:31:34,572 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:31:34,575 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:31:34,579 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:34,582 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:31:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:31:34,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:34,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:34,584 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states and 10 transitions. [2020-07-29 01:31:34,585 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states and 10 transitions. [2020-07-29 01:31:34,585 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:34,587 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. [2020-07-29 01:31:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2020-07-29 01:31:34,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:34,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:34,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:34,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:31:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2020-07-29 01:31:34,592 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2020-07-29 01:31:34,592 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2020-07-29 01:31:34,593 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:31:34,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. [2020-07-29 01:31:34,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:34,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:34,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:34,595 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:31:34,595 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:31:34,596 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 80#L10-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 76#L12-2 [2020-07-29 01:31:34,596 INFO L796 eck$LassoCheckResult]: Loop: 76#L12-2 assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 76#L12-2 [2020-07-29 01:31:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:34,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:31:34,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:34,597 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228999242] [2020-07-29 01:31:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:34,612 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:34,624 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:34,628 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:34,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:34,630 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:31:34,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:34,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790117383] [2020-07-29 01:31:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:34,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:34,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:34,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:31:34,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:34,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294467871] [2020-07-29 01:31:34,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:34,670 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:34,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:34,684 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:34,752 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:34,753 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:34,753 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:34,753 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:34,753 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:34,754 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:34,754 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:34,754 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:34,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv.c_Iteration2_Lasso [2020-07-29 01:31:34,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:34,754 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:34,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:34,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:34,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:34,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:34,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:34,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:34,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:35,045 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:35,046 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:35,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:35,051 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:35,056 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:35,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:35,107 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,116 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:35,116 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:35,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:35,166 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 01:31:35,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:35,226 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,280 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:35,282 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:35,282 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:35,283 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:35,283 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:35,283 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:35,283 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,283 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:35,283 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:35,283 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv.c_Iteration2_Lasso [2020-07-29 01:31:35,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:35,284 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:35,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:35,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:35,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:35,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:35,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:35,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:35,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:35,534 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:35,534 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:35,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:35,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:35,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:35,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:35,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:35,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:35,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:35,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:35,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:35,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:35,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:35,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:35,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:35,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:35,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,589 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:35,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:35,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:35,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:35,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:35,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:35,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:35,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:35,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:35,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:35,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:35,662 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:35,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:35,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:35,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:35,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:35,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:35,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:35,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:35,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:35,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:35,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:35,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:35,709 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:35,725 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:31:35,726 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. 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 01:31:35,736 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:35,740 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:31:35,741 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:35,741 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 2147483647 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2020-07-29 01:31:35,777 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:31:35,782 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0;" [2020-07-29 01:31:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:35,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:35,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:31:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:35,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:35,828 INFO L280 TraceCheckUtils]: 0: Hoare triple {125#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {125#unseeded} is VALID [2020-07-29 01:31:35,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {125#unseeded} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {144#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:31:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:35,834 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:31:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:35,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:35,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {145#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~y~0) 2147483647)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {147#(and (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~y~0) 2147483647)) (>= oldRank0 0)) unseeded) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:31:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:35,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:35,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:35,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:35,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,850 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:31:35,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-07-29 01:31:35,896 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 9 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 13 states and 18 transitions. Complement of second has 5 states. [2020-07-29 01:31:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:35,896 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:35,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 9 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:35,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:35,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:35,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:35,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:35,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:35,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:35,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:31:35,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:35,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:35,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:35,900 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 9 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:35,900 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:35,900 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:35,901 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:35,901 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:35,901 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 9 [2020-07-29 01:31:35,901 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:35,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:35,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:35,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:35,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:35,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:35,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:35,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:31:35,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:31:35,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:31:35,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:35,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:35,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:35,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:31:35,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:31:35,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:31:35,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:35,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:35,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:35,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:35,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:35,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:35,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:35,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:35,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:35,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 9 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:31:35,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:31:35,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:31:35,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,931 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:35,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:35,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:35,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:31:35,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:35,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. cyclomatic complexity: 9 [2020-07-29 01:31:35,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:35,957 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 13 transitions. [2020-07-29 01:31:35,957 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:31:35,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:31:35,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2020-07-29 01:31:35,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:35,958 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2020-07-29 01:31:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2020-07-29 01:31:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 6. [2020-07-29 01:31:35,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:35,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 13 transitions. Second operand 6 states. [2020-07-29 01:31:35,959 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 13 transitions. Second operand 6 states. [2020-07-29 01:31:35,959 INFO L87 Difference]: Start difference. First operand 9 states and 13 transitions. Second operand 6 states. [2020-07-29 01:31:35,960 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:35,961 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2020-07-29 01:31:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-07-29 01:31:35,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:35,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:35,961 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 9 states and 13 transitions. [2020-07-29 01:31:35,962 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 9 states and 13 transitions. [2020-07-29 01:31:35,964 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:35,966 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2020-07-29 01:31:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2020-07-29 01:31:35,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:35,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:35,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:35,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:31:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2020-07-29 01:31:35,971 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:31:35,971 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2020-07-29 01:31:35,971 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:31:35,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2020-07-29 01:31:35,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:35,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:35,972 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:35,973 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-07-29 01:31:35,973 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:31:35,973 INFO L794 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 181#L10-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 178#L12-2 assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); 179#L12-3 main_~x~0 := main_~x~0 - 1; 182#L10-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 177#L12-2 [2020-07-29 01:31:35,973 INFO L796 eck$LassoCheckResult]: Loop: 177#L12-2 assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 177#L12-2 [2020-07-29 01:31:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:35,978 INFO L82 PathProgramCache]: Analyzing trace with hash 29867642, now seen corresponding path program 2 times [2020-07-29 01:31:35,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:35,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586411401] [2020-07-29 01:31:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:35,990 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:36,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:36,016 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:36,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:31:36,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:36,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145739679] [2020-07-29 01:31:36,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:36,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:36,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:36,051 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash 925896921, now seen corresponding path program 1 times [2020-07-29 01:31:36,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:36,052 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425389785] [2020-07-29 01:31:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:36,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {236#true} is VALID [2020-07-29 01:31:36,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {238#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:31:36,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 1)} assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); {239#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:31:36,185 INFO L280 TraceCheckUtils]: 3: Hoare triple {239#(<= ULTIMATE.start_main_~x~0 1)} main_~x~0 := main_~x~0 - 1; {240#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:31:36,186 INFO L280 TraceCheckUtils]: 4: Hoare triple {240#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {241#(<= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:31:36,186 INFO L280 TraceCheckUtils]: 5: Hoare triple {241#(<= (+ ULTIMATE.start_main_~x~0 1) ULTIMATE.start_main_~y~0)} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {237#false} is VALID [2020-07-29 01:31:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:36,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425389785] [2020-07-29 01:31:36,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240397379] [2020-07-29 01:31:36,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:31:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:36,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:36,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:36,270 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:31:36,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {236#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {236#true} is VALID [2020-07-29 01:31:36,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {236#true} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {238#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:31:36,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {238#(<= ULTIMATE.start_main_~y~0 1)} assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); {239#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:31:36,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {239#(<= ULTIMATE.start_main_~x~0 1)} main_~x~0 := main_~x~0 - 1; {240#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:31:36,341 INFO L280 TraceCheckUtils]: 4: Hoare triple {240#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {257#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 0))} is VALID [2020-07-29 01:31:36,342 INFO L280 TraceCheckUtils]: 5: Hoare triple {257#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 0))} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {237#false} is VALID [2020-07-29 01:31:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:36,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:36,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 01:31:36,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785370648] [2020-07-29 01:31:36,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:31:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:31:36,368 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-07-29 01:31:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:36,494 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-29 01:31:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:31:36,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:31:36,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:36,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2020-07-29 01:31:36,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:36,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 8 states and 10 transitions. [2020-07-29 01:31:36,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:31:36,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:31:36,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-07-29 01:31:36,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:36,510 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:31:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-07-29 01:31:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-07-29 01:31:36,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:36,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:31:36,513 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:31:36,513 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 7 states. [2020-07-29 01:31:36,514 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:36,517 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:31:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:31:36,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:36,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:36,518 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states and 10 transitions. [2020-07-29 01:31:36,518 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states and 10 transitions. [2020-07-29 01:31:36,520 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:36,522 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2020-07-29 01:31:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:31:36,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:36,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:36,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:36,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:36,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:36,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:31:36,526 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:31:36,526 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:31:36,526 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:31:36,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:31:36,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:36,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:36,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:36,528 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:31:36,528 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:31:36,528 INFO L794 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 282#L10-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 279#L12-2 assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 280#L12-2 assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); 284#L12-3 main_~x~0 := main_~x~0 - 1; 283#L10-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 278#L12-2 [2020-07-29 01:31:36,528 INFO L796 eck$LassoCheckResult]: Loop: 278#L12-2 assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 278#L12-2 [2020-07-29 01:31:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 2 times [2020-07-29 01:31:36,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:36,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681754732] [2020-07-29 01:31:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:36,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:36,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:36,561 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 3 times [2020-07-29 01:31:36,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:36,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133805728] [2020-07-29 01:31:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:36,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:36,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:36,572 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285992, now seen corresponding path program 3 times [2020-07-29 01:31:36,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:36,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339002695] [2020-07-29 01:31:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:36,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {344#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {344#true} is VALID [2020-07-29 01:31:36,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#true} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {346#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:31:36,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#(<= ULTIMATE.start_main_~y~0 1)} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {347#(<= ULTIMATE.start_main_~y~0 2)} is VALID [2020-07-29 01:31:36,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#(<= ULTIMATE.start_main_~y~0 2)} assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); {348#(<= ULTIMATE.start_main_~x~0 2)} is VALID [2020-07-29 01:31:36,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#(<= ULTIMATE.start_main_~x~0 2)} main_~x~0 := main_~x~0 - 1; {349#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:31:36,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#(<= ULTIMATE.start_main_~x~0 1)} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {350#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-29 01:31:36,668 INFO L280 TraceCheckUtils]: 6: Hoare triple {350#(<= ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {345#false} is VALID [2020-07-29 01:31:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:36,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339002695] [2020-07-29 01:31:36,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111264667] [2020-07-29 01:31:36,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:36,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:31:36,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:31:36,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:31:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:36,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:36,760 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:31:36,822 INFO L280 TraceCheckUtils]: 0: Hoare triple {344#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {344#true} is VALID [2020-07-29 01:31:36,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {344#true} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {346#(<= ULTIMATE.start_main_~y~0 1)} is VALID [2020-07-29 01:31:36,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#(<= ULTIMATE.start_main_~y~0 1)} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {347#(<= ULTIMATE.start_main_~y~0 2)} is VALID [2020-07-29 01:31:36,825 INFO L280 TraceCheckUtils]: 3: Hoare triple {347#(<= ULTIMATE.start_main_~y~0 2)} assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); {348#(<= ULTIMATE.start_main_~x~0 2)} is VALID [2020-07-29 01:31:36,826 INFO L280 TraceCheckUtils]: 4: Hoare triple {348#(<= ULTIMATE.start_main_~x~0 2)} main_~x~0 := main_~x~0 - 1; {349#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:31:36,827 INFO L280 TraceCheckUtils]: 5: Hoare triple {349#(<= ULTIMATE.start_main_~x~0 1)} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {369#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 1))} is VALID [2020-07-29 01:31:36,828 INFO L280 TraceCheckUtils]: 6: Hoare triple {369#(and (<= 1 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~x~0 1))} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {345#false} is VALID [2020-07-29 01:31:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:36,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:36,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:31:36,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111836585] [2020-07-29 01:31:36,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:36,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:31:36,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:31:36,848 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 8 states. [2020-07-29 01:31:37,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:37,003 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2020-07-29 01:31:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:31:37,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:31:37,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:37,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2020-07-29 01:31:37,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:37,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 12 transitions. [2020-07-29 01:31:37,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:31:37,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:31:37,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2020-07-29 01:31:37,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:37,022 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:31:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2020-07-29 01:31:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2020-07-29 01:31:37,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:37,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 12 transitions. Second operand 8 states. [2020-07-29 01:31:37,024 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 12 transitions. Second operand 8 states. [2020-07-29 01:31:37,024 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 8 states. [2020-07-29 01:31:37,024 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:37,026 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:31:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:31:37,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:37,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:37,027 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 10 states and 12 transitions. [2020-07-29 01:31:37,027 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 10 states and 12 transitions. [2020-07-29 01:31:37,028 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:37,029 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:31:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:31:37,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:37,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:37,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:37,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:31:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 01:31:37,031 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:31:37,031 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:31:37,031 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:31:37,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:31:37,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:37,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:37,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:37,034 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-07-29 01:31:37,034 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:31:37,034 INFO L794 eck$LassoCheckResult]: Stem: 393#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; 394#L10-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 391#L12-2 assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 392#L12-2 assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 397#L12-2 assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); 396#L12-3 main_~x~0 := main_~x~0 - 1; 395#L10-2 assume !!(main_~x~0 >= 0);main_~y~0 := 1; 390#L12-2 [2020-07-29 01:31:37,035 INFO L796 eck$LassoCheckResult]: Loop: 390#L12-2 assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; 390#L12-2 [2020-07-29 01:31:37,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:37,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1360231782, now seen corresponding path program 4 times [2020-07-29 01:31:37,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:37,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687024718] [2020-07-29 01:31:37,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:37,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:37,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:37,074 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:37,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:37,074 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 4 times [2020-07-29 01:31:37,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:37,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893270392] [2020-07-29 01:31:37,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:37,085 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:37,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:37,089 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:37,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:37,089 INFO L82 PathProgramCache]: Analyzing trace with hash 782487737, now seen corresponding path program 5 times [2020-07-29 01:31:37,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:37,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835815707] [2020-07-29 01:31:37,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:37,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:37,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:37,130 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:37,261 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:37,262 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:37,262 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:37,262 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:37,262 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:37,262 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,262 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:37,263 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:37,263 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv.c_Iteration5_Lasso [2020-07-29 01:31:37,263 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:37,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:37,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,475 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:37,475 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:31:37,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:37,484 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,488 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:37,488 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:31:37,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:37,538 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,542 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:37,542 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:37,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:37,582 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:37,582 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} 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 01:31:37,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:37,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:37,626 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:37,626 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:37,652 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,679 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:37,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:37,707 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:37,709 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:37,709 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:37,709 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:37,709 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:37,709 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:37,709 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,709 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:37,709 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:37,710 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv.c_Iteration5_Lasso [2020-07-29 01:31:37,710 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:37,710 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:37,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 01:31:37,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:37,930 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:37,930 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:31:37,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:37,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:37,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:37,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:37,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:37,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:37,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:37,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:37,984 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:37,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:37,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:37,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:37,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:37,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:37,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:37,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:37,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:38,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:38,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:38,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:38,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:38,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:38,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:38,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:38,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:38,016 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 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 01:31:38,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:38,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:38,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:38,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:38,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:38,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:38,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:38,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:38,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:38,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:38,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:38,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:38,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:38,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:38,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:38,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:38,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:38,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:38,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:38,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:38,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:38,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:38,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:38,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:38,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:38,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:38,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:38,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:38,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:38,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:38,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:38,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:38,199 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:38,199 INFO L444 ModelExtractionUtils]: 5 out of 10 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:38,206 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:38,210 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:31:38,210 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:38,210 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = -2*ULTIMATE.start_main_~y~0 + 2147483647 Supporting invariants [1*ULTIMATE.start_main_~y~0 - 1 >= 0] [2020-07-29 01:31:38,248 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:31:38,253 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0;" [2020-07-29 01:31:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:38,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:31:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:38,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {471#unseeded} is VALID [2020-07-29 01:31:38,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {471#unseeded} is VALID [2020-07-29 01:31:38,302 INFO L280 TraceCheckUtils]: 2: Hoare triple {471#unseeded} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:31:38,303 INFO L280 TraceCheckUtils]: 3: Hoare triple {471#unseeded} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:31:38,303 INFO L280 TraceCheckUtils]: 4: Hoare triple {471#unseeded} assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); {471#unseeded} is VALID [2020-07-29 01:31:38,304 INFO L280 TraceCheckUtils]: 5: Hoare triple {471#unseeded} main_~x~0 := main_~x~0 - 1; {471#unseeded} is VALID [2020-07-29 01:31:38,305 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {490#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:31:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,310 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:31:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:38,319 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~y~0) 2147483647)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {493#(and (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~y~0) 2147483647)) (>= oldRank0 0)) unseeded) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:31:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:38,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:38,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:38,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,331 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:31:38,331 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:38,373 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 15 states and 19 transitions. Complement of second has 5 states. [2020-07-29 01:31:38,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:38,374 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:38,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:38,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:38,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:38,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:38,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:38,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:38,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:31:38,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:38,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:38,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:38,377 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,377 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:38,377 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:38,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:38,378 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:38,378 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 7 [2020-07-29 01:31:38,379 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:38,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:38,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:38,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:38,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,390 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:38,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,392 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:31:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:38,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {471#unseeded} is VALID [2020-07-29 01:31:38,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {471#unseeded} is VALID [2020-07-29 01:31:38,430 INFO L280 TraceCheckUtils]: 2: Hoare triple {471#unseeded} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:31:38,431 INFO L280 TraceCheckUtils]: 3: Hoare triple {471#unseeded} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:31:38,431 INFO L280 TraceCheckUtils]: 4: Hoare triple {471#unseeded} assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); {471#unseeded} is VALID [2020-07-29 01:31:38,432 INFO L280 TraceCheckUtils]: 5: Hoare triple {471#unseeded} main_~x~0 := main_~x~0 - 1; {471#unseeded} is VALID [2020-07-29 01:31:38,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {490#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:31:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,437 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:31:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:38,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~y~0) 2147483647)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {493#(and (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~y~0) 2147483647)) (>= oldRank0 0)) unseeded) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:31:38,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:38,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:38,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,449 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:31:38,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:38,488 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 15 states and 19 transitions. Complement of second has 5 states. [2020-07-29 01:31:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:38,488 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:38,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:38,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:38,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:38,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:38,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:38,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:38,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:31:38,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:38,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:38,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:38,491 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,492 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:38,492 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:38,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:38,492 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:38,493 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 7 [2020-07-29 01:31:38,493 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:38,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:38,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:38,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:38,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,501 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:38,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:38,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,502 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:38,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:31:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:38,555 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~c~0, main_~x~0, main_~y~0;havoc main_~c~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~c~0 := 0; {471#unseeded} is VALID [2020-07-29 01:31:38,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {471#unseeded} is VALID [2020-07-29 01:31:38,556 INFO L280 TraceCheckUtils]: 2: Hoare triple {471#unseeded} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:31:38,560 INFO L280 TraceCheckUtils]: 3: Hoare triple {471#unseeded} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {471#unseeded} is VALID [2020-07-29 01:31:38,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {471#unseeded} assume !(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824); {471#unseeded} is VALID [2020-07-29 01:31:38,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {471#unseeded} main_~x~0 := main_~x~0 - 1; {471#unseeded} is VALID [2020-07-29 01:31:38,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#unseeded} assume !!(main_~x~0 >= 0);main_~y~0 := 1; {490#(and (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:31:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,566 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:31:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:38,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:38,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {491#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~y~0) 2147483647)) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} assume !!(main_~x~0 > main_~y~0 && main_~y~0 < 1073741824);main_~y~0 := 2 * main_~y~0; {493#(and (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~y~0) 2147483647)) (>= oldRank0 0)) unseeded) (>= (+ ULTIMATE.start_main_~y~0 (- 1)) 0))} is VALID [2020-07-29 01:31:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:38,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:38,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:38,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,587 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 1 loop predicates [2020-07-29 01:31:38,587 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:38,645 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 11 states and 13 transitions. Complement of second has 4 states. [2020-07-29 01:31:38,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:31:38,646 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:38,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:38,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:38,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:38,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:38,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:38,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:38,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:31:38,648 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:38,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:38,649 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,649 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:38,649 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:38,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:38,650 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:38,650 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:38,650 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:31:38,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:31:38,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:31:38,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:31:38,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:31:38,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:38,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:38,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,657 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:38,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:31:38,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:31:38,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:31:38,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:38,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:38,660 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:38,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-07-29 01:31:38,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:31:38,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:31:38,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:31:38,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:38,660 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:38,661 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:38,661 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:38,661 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:31:38,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:31:38,661 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:38,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:38,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:31:38 BoogieIcfgContainer [2020-07-29 01:31:38,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:31:38,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:31:38,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:31:38,669 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:31:38,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:32" (3/4) ... [2020-07-29 01:31:38,674 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:31:38,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:31:38,677 INFO L168 Benchmark]: Toolchain (without parser) took 6367.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 956.2 MB in the beginning and 838.8 MB in the end (delta: 117.4 MB). Peak memory consumption was 326.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:38,678 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:38,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.99 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 01:31:38,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.54 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:38,680 INFO L168 Benchmark]: Boogie Preprocessor took 77.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:38,681 INFO L168 Benchmark]: RCFGBuilder took 250.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:38,682 INFO L168 Benchmark]: BuchiAutomizer took 5704.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 838.8 MB in the end (delta: 272.1 MB). Peak memory consumption was 347.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:38,682 INFO L168 Benchmark]: Witness Printer took 5.24 ms. Allocated memory is still 1.2 GB. Free memory is still 838.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:38,686 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.26 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 285.99 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 37.54 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -184.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 250.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5704.50 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 838.8 MB in the end (delta: 272.1 MB). Peak memory consumption was 347.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.24 ms. Allocated memory is still 1.2 GB. Free memory is still 838.8 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * y + 2147483647 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * y + 2147483647 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 8 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 36 SDslu, 11 SDs, 0 SdLazy, 80 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax157 hnf97 lsp57 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq153 hnf93 smp100 dnf100 smp100 tf102 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 8 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 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...