./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.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-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.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 775ea6e0a1296fd7b29dfc5da5a4c77d3361f4a8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:28:26,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:26,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:26,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:26,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:26,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:26,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:26,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:26,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:26,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:26,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:26,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:26,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:26,926 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:26,927 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:26,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:26,929 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:26,930 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:26,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:26,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:26,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:26,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:26,938 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:26,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:26,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:26,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:26,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:26,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:26,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:26,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:26,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:26,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:26,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:26,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:26,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:26,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:26,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:26,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:26,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:26,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:26,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:26,952 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:28:26,968 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:26,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:26,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:26,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:26,970 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:26,971 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:26,971 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:26,971 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:26,971 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:26,972 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:26,972 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:26,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:26,972 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:26,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:26,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:26,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:26,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:26,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:26,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:26,974 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:26,974 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:26,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:26,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:26,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:26,975 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:26,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:26,976 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:26,976 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:26,976 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:26,977 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:26,977 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 -> 775ea6e0a1296fd7b29dfc5da5a4c77d3361f4a8 [2020-07-29 01:28:27,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:27,280 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:27,284 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:27,286 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:27,288 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:27,288 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.c [2020-07-29 01:28:27,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22d2891e/e808c288b35446fabfec2f7f51369672/FLAG672142892 [2020-07-29 01:28:27,826 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:27,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-while2.c [2020-07-29 01:28:27,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22d2891e/e808c288b35446fabfec2f7f51369672/FLAG672142892 [2020-07-29 01:28:28,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c22d2891e/e808c288b35446fabfec2f7f51369672 [2020-07-29 01:28:28,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:28,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:28,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:28,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:28,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:28,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6041b9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28, skipping insertion in model container [2020-07-29 01:28:28,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:28,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:28,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:28,462 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:28,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:28,488 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:28,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28 WrapperNode [2020-07-29 01:28:28,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:28,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:28,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:28,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:28,496 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:28:28" (1/1) ... [2020-07-29 01:28:28,500 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:28:28" (1/1) ... [2020-07-29 01:28:28,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:28,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:28,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:28,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:28,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (1/1) ... [2020-07-29 01:28:28,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:28,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:28,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:28,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:28,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (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:28:28,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:28,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:28,817 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:28,817 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:28:28,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:28 BoogieIcfgContainer [2020-07-29 01:28:28,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:28,820 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:28,820 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:28,824 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:28,825 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:28,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:28" (1/3) ... [2020-07-29 01:28:28,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41a53645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:28, skipping insertion in model container [2020-07-29 01:28:28,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:28,826 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:28" (2/3) ... [2020-07-29 01:28:28,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@41a53645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:28, skipping insertion in model container [2020-07-29 01:28:28,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:28,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:28" (3/3) ... [2020-07-29 01:28:28,829 INFO L371 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-while2.c [2020-07-29 01:28:28,939 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:28,939 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:28,939 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:28,939 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:28,939 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:28,940 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:28,940 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:28,940 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:28,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:28,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:28,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:28,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:28,991 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:28,991 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:28,992 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:28,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:28,994 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:28,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:28,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:28,994 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:28,994 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:29,000 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; 3#L17-2true [2020-07-29 01:28:29,000 INFO L796 eck$LassoCheckResult]: Loop: 3#L17-2true assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; 6#L19-2true assume !(main_~j~0 > 0); 5#L19-3true main_~i~0 := main_~i~0 - 1; 3#L17-2true [2020-07-29 01:28:29,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:29,006 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:28:29,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:29,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529513962] [2020-07-29 01:28:29,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:29,079 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:29,082 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:29,099 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:28:29,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:29,101 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996755374] [2020-07-29 01:28:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:29,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:29,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:29,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2020-07-29 01:28:29,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:29,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006492360] [2020-07-29 01:28:29,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,225 INFO L280 TraceCheckUtils]: 0: Hoare triple {16#true} havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; {18#(= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:28:29,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#(= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {19#(<= 1 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:28:29,228 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#(<= 1 ULTIMATE.start_main_~j~0)} assume !(main_~j~0 > 0); {17#false} is VALID [2020-07-29 01:28:29,228 INFO L280 TraceCheckUtils]: 3: Hoare triple {17#false} main_~i~0 := main_~i~0 - 1; {17#false} is VALID [2020-07-29 01:28:29,230 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:28:29,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006492360] [2020-07-29 01:28:29,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:28:29,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:28:29,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694758518] [2020-07-29 01:28:29,293 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:29,294 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:29,294 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:29,294 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:29,294 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:29,295 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,295 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:29,295 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:29,295 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration1_Loop [2020-07-29 01:28:29,295 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:29,296 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:29,332 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:28:29,345 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:28:29,352 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:28:29,363 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:28:29,566 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:29,567 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:29,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:29,588 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:29,589 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:28:29,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:29,625 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:28:29,631 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:29,631 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:29,670 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:29,680 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:29,681 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=-3, ULTIMATE.start_main_~N~0=-3} Honda state: {ULTIMATE.start_main_~j~0=-3, ULTIMATE.start_main_~N~0=-3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:29,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:29,728 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:29,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:29,786 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,837 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:29,840 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:29,840 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:29,840 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:29,840 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:29,840 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:29,840 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:29,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:29,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration1_Loop [2020-07-29 01:28:29,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:29,842 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:29,857 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:28:29,864 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:28:29,876 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:28:29,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:28:30,044 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:30,050 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:30,054 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:30,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:30,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:30,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:30,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:30,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:30,070 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,099 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:28:30,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:30,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:30,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:30,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:30,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:30,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:30,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:30,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:30,154 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:28:30,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:30,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:30,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:30,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:30,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:30,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:30,213 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:28:30,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:30,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:30,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:30,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:30,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:30,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:30,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,222 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:30,227 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:30,228 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:30,241 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:30,242 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:30,242 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:30,243 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,272 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:30,279 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0;" "assume !(main_~j~0 > 0);" "main_~i~0 := main_~i~0 - 1;" [2020-07-29 01:28:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:30,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:30,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:30,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; {20#unseeded} is VALID [2020-07-29 01:28:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:30,342 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:30,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:30,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#(>= oldRank0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {38#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:30,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {38#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} assume !(main_~j~0 > 0); {38#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:30,375 INFO L280 TraceCheckUtils]: 2: Hoare triple {38#(and (<= ULTIMATE.start_main_~i~0 oldRank0) (< 0 ULTIMATE.start_main_~i~0))} main_~i~0 := main_~i~0 - 1; {33#(or (and (> oldRank0 ULTIMATE.start_main_~i~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:30,376 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:28:30,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:30,398 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:28:30,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:30,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,409 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:28:30,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2020-07-29 01:28:30,490 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:28:30,490 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:28:30,491 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:30,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:30,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:30,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:30,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:30,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:30,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:30,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:30,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:30,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2020-07-29 01:28:30,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:30,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:30,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:30,503 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:28:30,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:30,505 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:30,506 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:30,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:30,509 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:30,509 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 01:28:30,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:30,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:30,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:30,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,511 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:28:30,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:30,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:30,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,513 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:28:30,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:30,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:30,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,515 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:28:30,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:30,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:30,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,517 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:28:30,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:30,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:30,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,519 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:28:30,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:30,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:30,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,520 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:28:30,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:30,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:30,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,522 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:28:30,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:30,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,524 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:28:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:30,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:30,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,526 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:28:30,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:30,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:30,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,527 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:28:30,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:30,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:30,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,529 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:28:30,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:30,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:30,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,531 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:28:30,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,531 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 01:28:30,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:30,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:30,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:30,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:30,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 35 transitions. cyclomatic complexity: 15 [2020-07-29 01:28:30,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:30,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2020-07-29 01:28:30,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:28:30,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:28:30,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-29 01:28:30,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:30,551 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-29 01:28:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2020-07-29 01:28:30,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:30,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:28:30,582 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:28:30,585 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 6 states. [2020-07-29 01:28:30,588 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:30,591 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:28:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:30,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:30,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:30,593 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:30,594 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:30,594 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:30,596 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. [2020-07-29 01:28:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2020-07-29 01:28:30,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:30,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:30,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:30,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2020-07-29 01:28:30,600 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 9 transitions. [2020-07-29 01:28:30,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:30,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:30,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:30,604 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2020-07-29 01:28:30,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:30,654 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2020-07-29 01:28:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:28:30,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:30,661 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:28:30,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 15 transitions. [2020-07-29 01:28:30,664 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:28:30,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 15 transitions. [2020-07-29 01:28:30,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:30,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:30,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2020-07-29 01:28:30,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:30,666 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 01:28:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2020-07-29 01:28:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2020-07-29 01:28:30,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:30,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:28:30,668 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:28:30,668 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:28:30,669 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:30,670 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2020-07-29 01:28:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2020-07-29 01:28:30,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:30,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:30,672 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 11 states and 15 transitions. [2020-07-29 01:28:30,672 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 11 states and 15 transitions. [2020-07-29 01:28:30,673 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:30,674 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2020-07-29 01:28:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2020-07-29 01:28:30,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:30,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:30,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:30,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:28:30,677 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:30,678 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:30,678 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:30,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:30,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:30,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:30,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:30,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:30,680 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:30,680 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; 133#L17-2 assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; 134#L19-2 [2020-07-29 01:28:30,680 INFO L796 eck$LassoCheckResult]: Loop: 134#L19-2 assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; 134#L19-2 [2020-07-29 01:28:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:28:30,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:30,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818338555] [2020-07-29 01:28:30,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:30,693 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:28:30,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:30,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595717413] [2020-07-29 01:28:30,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,703 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:30,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:28:30,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:30,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268775073] [2020-07-29 01:28:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,716 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,718 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:30,739 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:30,740 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:30,740 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:30,740 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:30,740 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:30,740 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,740 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:30,740 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:30,741 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration2_Loop [2020-07-29 01:28:30,741 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:30,741 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:30,750 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:28:30,757 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:28:30,766 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:28:30,863 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:30,863 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:30,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:30,877 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,882 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:30,882 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:30,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:30,930 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:30,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:30,984 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:31,027 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:31,030 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:31,030 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:31,030 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:31,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:31,031 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:31,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:31,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:31,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:31,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration2_Loop [2020-07-29 01:28:31,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:31,032 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:31,044 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:28:31,051 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:28:31,061 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:28:31,166 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:31,167 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:31,179 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:28:31,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:31,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:31,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:31,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:31,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:31,190 INFO L402 nArgumentSynthesizer]: A total of 2 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:28:31,196 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) [2020-07-29 01:28:31,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:31,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:31,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:31,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:31,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:31,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:31,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:31,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:31,261 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:31,266 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:31,266 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:31,279 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:31,279 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:31,279 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:31,279 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 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:28:31,323 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:31,326 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1;" [2020-07-29 01:28:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:31,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:31,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:31,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {193#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; {193#unseeded} is VALID [2020-07-29 01:28:31,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#unseeded} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {193#unseeded} is VALID [2020-07-29 01:28:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:31,366 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:31,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:31,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#(>= oldRank0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {206#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~j~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:28:31,371 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:28:31,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:31,375 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:28:31,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:31,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,376 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:28:31,377 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-07-29 01:28:31,410 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 14 states and 19 transitions. Complement of second has 5 states. [2020-07-29 01:28:31,410 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:28:31,410 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:31,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:31,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:31,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:31,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:31,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:31,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:31,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:31,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:28:31,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:31,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:31,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:31,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:31,414 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:31,417 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:31,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:31,419 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:31,419 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 19 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:31,420 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:31,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:31,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:31,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:31,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:31,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:31,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:31,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:31,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:31,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:31,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:31,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:31,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:31,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:31,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:31,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:31,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:31,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:31,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:31,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:31,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:31,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:31,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:31,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:31,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:31,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:31,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:31,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:31,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,436 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:28:31,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:31,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:31,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:31,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:31,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:31,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:31,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 14 transitions. [2020-07-29 01:28:31,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:28:31,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:28:31,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2020-07-29 01:28:31,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:31,445 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2020-07-29 01:28:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2020-07-29 01:28:31,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2020-07-29 01:28:31,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:31,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 14 transitions. Second operand 7 states. [2020-07-29 01:28:31,448 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 14 transitions. Second operand 7 states. [2020-07-29 01:28:31,448 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 7 states. [2020-07-29 01:28:31,449 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:31,454 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-29 01:28:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:28:31,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:31,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:31,455 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 10 states and 14 transitions. [2020-07-29 01:28:31,456 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 10 states and 14 transitions. [2020-07-29 01:28:31,463 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:31,465 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2020-07-29 01:28:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2020-07-29 01:28:31,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:31,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:31,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:31,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:28:31,470 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:28:31,470 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:28:31,470 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:31,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:28:31,471 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:31,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:31,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:31,472 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:28:31,472 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:31,473 INFO L794 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; 235#L17-2 assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; 236#L19-2 assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; 239#L19-2 assume !(main_~j~0 > 0); 240#L19-3 main_~i~0 := main_~i~0 - 1; 237#L17-2 assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; 238#L19-2 [2020-07-29 01:28:31,473 INFO L796 eck$LassoCheckResult]: Loop: 238#L19-2 assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; 238#L19-2 [2020-07-29 01:28:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 1 times [2020-07-29 01:28:31,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:31,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067083915] [2020-07-29 01:28:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:31,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {297#true} havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; {299#(= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:28:31,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {299#(= ULTIMATE.start_main_~N~0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {300#(= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:28:31,599 INFO L280 TraceCheckUtils]: 2: Hoare triple {300#(= ULTIMATE.start_main_~j~0 ULTIMATE.start_main_~i~0)} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {301#(<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 1))} is VALID [2020-07-29 01:28:31,600 INFO L280 TraceCheckUtils]: 3: Hoare triple {301#(<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 1))} assume !(main_~j~0 > 0); {302#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:28:31,602 INFO L280 TraceCheckUtils]: 4: Hoare triple {302#(<= ULTIMATE.start_main_~i~0 1)} main_~i~0 := main_~i~0 - 1; {303#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:28:31,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {298#false} is VALID [2020-07-29 01:28:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:31,604 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067083915] [2020-07-29 01:28:31,605 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804744400] [2020-07-29 01:28:31,605 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:28:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:31,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 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:28:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:31,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:31,848 INFO L280 TraceCheckUtils]: 0: Hoare triple {297#true} havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; {307#(<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~N~0)} is VALID [2020-07-29 01:28:31,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#(<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~N~0)} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {311#(<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:28:31,850 INFO L280 TraceCheckUtils]: 2: Hoare triple {311#(<= ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {301#(<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 1))} is VALID [2020-07-29 01:28:31,851 INFO L280 TraceCheckUtils]: 3: Hoare triple {301#(<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 1))} assume !(main_~j~0 > 0); {302#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:28:31,853 INFO L280 TraceCheckUtils]: 4: Hoare triple {302#(<= ULTIMATE.start_main_~i~0 1)} main_~i~0 := main_~i~0 - 1; {303#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:28:31,855 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {298#false} is VALID [2020-07-29 01:28:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:31,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:28:31,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-07-29 01:28:31,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304245209] [2020-07-29 01:28:31,857 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:28:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:28:31,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:31,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624590448] [2020-07-29 01:28:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:31,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:31,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:31,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:31,902 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:31,902 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:31,902 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:31,902 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:31,903 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:31,903 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:31,903 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:31,903 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:31,903 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration3_Loop [2020-07-29 01:28:31,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:31,903 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:31,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:31,920 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:28:31,928 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:28:32,018 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:32,018 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:32,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:32,023 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:32,029 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:32,029 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:32,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:32,076 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 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:28:32,133 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:32,133 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:28:32,170 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:32,172 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:32,173 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:32,173 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:32,173 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:32,173 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:32,173 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:32,173 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:32,173 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:32,173 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-while2.c_Iteration3_Loop [2020-07-29 01:28:32,173 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:32,174 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:32,182 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:28:32,186 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:28:32,194 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:28:32,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:32,273 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:32,280 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:28:32,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:32,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:32,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:32,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:32,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:32,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:32,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:32,331 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:32,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:32,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:32,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:32,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:32,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:32,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:32,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:32,336 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:32,339 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:32,339 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:32,341 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:32,341 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:32,342 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:32,342 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~j~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:32,370 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:32,373 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1;" [2020-07-29 01:28:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:32,408 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#unseeded} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {323#unseeded} is VALID [2020-07-29 01:28:32,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~j~0 > 0); {323#unseeded} is VALID [2020-07-29 01:28:32,410 INFO L280 TraceCheckUtils]: 4: Hoare triple {323#unseeded} main_~i~0 := main_~i~0 - 1; {323#unseeded} is VALID [2020-07-29 01:28:32,411 INFO L280 TraceCheckUtils]: 5: Hoare triple {323#unseeded} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,414 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:32,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#(>= oldRank0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {336#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~j~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:28:32,418 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:28:32,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:32,422 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:28:32,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,423 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:28:32,423 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:28:32,446 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2020-07-29 01:28:32,446 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:28:32,446 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:32,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:32,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:32,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:32,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:32,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:32,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:32,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:28:32,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:32,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:32,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:32,448 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,449 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:32,449 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:32,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:32,449 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:32,449 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:32,450 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:32,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:32,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:32,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,456 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:32,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:28:32,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,457 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:32,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#unseeded} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {323#unseeded} is VALID [2020-07-29 01:28:32,486 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~j~0 > 0); {323#unseeded} is VALID [2020-07-29 01:28:32,486 INFO L280 TraceCheckUtils]: 4: Hoare triple {323#unseeded} main_~i~0 := main_~i~0 - 1; {323#unseeded} is VALID [2020-07-29 01:28:32,487 INFO L280 TraceCheckUtils]: 5: Hoare triple {323#unseeded} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,490 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:32,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#(>= oldRank0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {336#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~j~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:28:32,494 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:28:32,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:32,499 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:28:32,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,499 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:28:32,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:28:32,513 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2020-07-29 01:28:32,514 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:28:32,514 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:32,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:32,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:32,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:32,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:32,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:32,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:32,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:28:32,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:32,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:32,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:32,517 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,517 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:32,517 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:32,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:32,518 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:32,518 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:32,518 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:32,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:32,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:32,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:32,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,525 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:28:32,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,526 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:32,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~i~0, main_~j~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~N~0;main_~N~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~i~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,549 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#unseeded} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,549 INFO L280 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {323#unseeded} is VALID [2020-07-29 01:28:32,550 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~j~0 > 0); {323#unseeded} is VALID [2020-07-29 01:28:32,550 INFO L280 TraceCheckUtils]: 4: Hoare triple {323#unseeded} main_~i~0 := main_~i~0 - 1; {323#unseeded} is VALID [2020-07-29 01:28:32,551 INFO L280 TraceCheckUtils]: 5: Hoare triple {323#unseeded} assume !!(main_~i~0 > 0);main_~j~0 := main_~N~0; {323#unseeded} is VALID [2020-07-29 01:28:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,554 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:32,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:32,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {326#(>= oldRank0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 > 0);main_~j~0 := main_~j~0 - 1; {336#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~j~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:28:32,557 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:28:32,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:32,561 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:28:32,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,562 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:28:32,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:28:32,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 10 states and 12 transitions. Complement of second has 4 states. [2020-07-29 01:28:32,590 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:28:32,590 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:32,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:32,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:32,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:32,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:32,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:32,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:32,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-07-29 01:28:32,592 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:32,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:32,592 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,592 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:32,592 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:32,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:32,593 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:32,593 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:32,594 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:32,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:32,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:32,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:32,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:32,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:32,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:32,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,599 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:28:32,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:28:32,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:32,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:32,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:32,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:32,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:32,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2020-07-29 01:28:32,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:32,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:32,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:32,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:32,602 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:32,602 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:32,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:32,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:28:32,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:28:32,603 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2020-07-29 01:28:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:32,603 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:28:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:28:32,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:28:32,615 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:28:32,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:28:32,615 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:32,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:28:32,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:32,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:32,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:32,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:32,616 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:32,616 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:32,616 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:32,616 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:32,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:32,617 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:32,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:32,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:32 BoogieIcfgContainer [2020-07-29 01:28:32,633 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:32,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:32,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:32,633 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:32,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:28" (3/4) ... [2020-07-29 01:28:32,637 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:32,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:32,641 INFO L168 Benchmark]: Toolchain (without parser) took 4425.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -116.1 MB). Peak memory consumption was 98.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:32,641 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:32,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.15 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 944.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:32,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.14 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:32,643 INFO L168 Benchmark]: Boogie Preprocessor took 73.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:32,644 INFO L168 Benchmark]: RCFGBuilder took 228.51 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:32,645 INFO L168 Benchmark]: BuchiAutomizer took 3812.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 115.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:32,645 INFO L168 Benchmark]: Witness Printer took 4.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:32,649 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.15 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 944.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.14 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 228.51 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3812.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.9 MB). Peak memory consumption was 115.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function i and consists of 5 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 38 SDslu, 13 SDs, 0 SdLazy, 34 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf98 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 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...