./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/BrockschmidtCookFuhs-CAV2013-Fig1.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 ef399329f84d2482fbc6cd637d6b986ccb5018221a1a0504f889d0bed5430f95 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:43,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:43,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:43,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:43,829 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:43,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:43,831 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:43,832 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:43,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:43,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:43,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:43,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:43,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:43,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:43,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:43,846 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:43,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:43,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:43,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:43,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:43,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:43,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:43,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:43,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:43,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:43,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:43,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:43,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:43,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:43,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:43,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:43,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:43,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:43,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:43,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:43,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:43,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:43,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:43,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:43,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:43,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:43,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:24:43,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:43,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:43,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:43,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:43,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:43,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:43,904 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:43,904 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:43,905 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:43,905 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:43,905 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:43,906 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:43,906 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:43,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:43,906 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:43,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:43,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:43,907 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:43,907 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:43,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:43,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:43,907 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:43,907 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:43,908 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:43,908 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:43,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:43,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:43,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:43,909 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:43,909 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ef399329f84d2482fbc6cd637d6b986ccb5018221a1a0504f889d0bed5430f95 [2022-02-21 03:24:44,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:44,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:44,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:44,131 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:44,131 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:44,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c [2022-02-21 03:24:44,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcee5793/daa78406e09248b2addd21910b781c47/FLAGe108e19ad [2022-02-21 03:24:44,569 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:44,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c [2022-02-21 03:24:44,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcee5793/daa78406e09248b2addd21910b781c47/FLAGe108e19ad [2022-02-21 03:24:44,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bcee5793/daa78406e09248b2addd21910b781c47 [2022-02-21 03:24:44,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:44,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:44,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:44,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:44,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:44,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a1917c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44, skipping insertion in model container [2022-02-21 03:24:44,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:44,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:44,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:44,746 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:44,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:44,778 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:44,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44 WrapperNode [2022-02-21 03:24:44,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:44,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:44,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:44,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:44,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,804 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-02-21 03:24:44,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:44,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:44,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:44,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:44,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:44,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:44,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:44,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:44,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (1/1) ... [2022-02-21 03:24:44,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:24:44,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:44,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:44,925 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:44,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:44,989 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:44,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:44,995 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:24:44,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:44 BoogieIcfgContainer [2022-02-21 03:24:44,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:44,997 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:44,998 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:45,000 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:45,000 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:45,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:44" (1/3) ... [2022-02-21 03:24:45,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f5679f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:45, skipping insertion in model container [2022-02-21 03:24:45,001 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:45,001 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:44" (2/3) ... [2022-02-21 03:24:45,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f5679f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:45, skipping insertion in model container [2022-02-21 03:24:45,002 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:45,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:44" (3/3) ... [2022-02-21 03:24:45,003 INFO L388 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig1.c [2022-02-21 03:24:45,035 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:45,035 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:45,036 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:45,036 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:45,036 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:45,036 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:45,036 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:45,036 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:45,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:45,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,064 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:45,064 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:45,064 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:45,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:45,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,066 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:45,067 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:45,071 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 3#L19-2true [2022-02-21 03:24:45,072 INFO L793 eck$LassoCheckResult]: Loop: 3#L19-2true assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 7#L21-2true assume !(main_~j~0#1 <= main_~i~0#1); 5#L21-3true main_~i~0#1 := 1 + main_~i~0#1; 3#L19-2true [2022-02-21 03:24:45,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:24:45,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:45,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224485643] [2022-02-21 03:24:45,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:45,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,167 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:45,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,170 INFO L85 PathProgramCache]: Analyzing trace with hash 40944, now seen corresponding path program 1 times [2022-02-21 03:24:45,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:45,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348777897] [2022-02-21 03:24:45,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:45,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,206 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,208 INFO L85 PathProgramCache]: Analyzing trace with hash 28699886, now seen corresponding path program 1 times [2022-02-21 03:24:45,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:45,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603362352] [2022-02-21 03:24:45,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:45,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:45,237 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:45,352 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:45,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:45,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:45,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:45,353 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:45,353 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,353 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:45,353 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:45,353 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration1_Loop [2022-02-21 03:24:45,353 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:45,353 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:45,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:45,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:45,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:45,474 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:45,475 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:45,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:45,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:45,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:24:45,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:24:45,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:45,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:45,661 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:45,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,668 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:45,668 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:45,668 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:45,668 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:45,668 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:45,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:45,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:45,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration1_Loop [2022-02-21 03:24:45,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:45,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:45,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:45,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:45,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:45,763 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:45,769 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:45,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:24:45,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:45,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:45,787 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:45,802 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:45,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:24:45,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,820 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:45,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:24:45,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:45,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:45,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:45,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:24:45,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:45,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,897 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:45,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:45,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:45,914 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:45,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:45,921 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:45,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:24:45,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:45,968 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:45,968 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:45,969 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:24:45,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,001 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:46,005 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;" "assume !(main_~j~0#1 <= main_~i~0#1);" "main_~i~0#1 := 1 + main_~i~0#1;" [2022-02-21 03:24:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,031 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#unseeded} assume { :begin_inline_ULTIMATE.init } true; {19#unseeded} is VALID [2022-02-21 03:24:46,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {19#unseeded} is VALID [2022-02-21 03:24:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,058 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#(>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {40#(and (>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:24:46,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 <= main_~i~0#1); {44#(and (< |ULTIMATE.start_main_~i~0#1| 0) (>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:46,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#(and (< |ULTIMATE.start_main_~i~0#1| 0) (>= oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)))} main_~i~0#1 := 1 + main_~i~0#1; {32#(or unseeded (and (> oldRank0 (* (- 1) |ULTIMATE.start_main_~i~0#1|)) (>= oldRank0 0)))} is VALID [2022-02-21 03:24:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:46,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:46,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:46,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,177 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:46,178 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 49 transitions. Complement of second has 9 states. [2022-02-21 03:24:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:46,272 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:46,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:24:46,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 49 transitions. [2022-02-21 03:24:46,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:46,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,280 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:46,281 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:46,282 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:24:46,284 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:46,284 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 49 transitions. cyclomatic complexity: 21 [2022-02-21 03:24:46,285 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:24:46,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:46,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:46,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:46,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:46,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:46,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:46,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:46,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:46,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:46,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:46,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:46,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:46,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:24:46,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:24:46,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:24:46,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:46,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:46,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:46,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:46,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:46,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:46,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:46,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:46,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:46,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:46,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:46,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:46,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:46,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:46,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:46,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:46,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:46,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:46,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:46,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:46,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:46,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:46,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 49 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:46,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,299 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-21 03:24:46,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:46,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:46,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 29 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:24:46,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:46,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 49 transitions. cyclomatic complexity: 21 [2022-02-21 03:24:46,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:46,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 14 states and 19 transitions. [2022-02-21 03:24:46,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:24:46,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:24:46,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:24:46,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:46,313 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:24:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:24:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:24:46,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:46,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,328 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,330 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,331 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:46,335 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2022-02-21 03:24:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:24:46,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:46,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:46,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:24:46,336 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:24:46,337 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:46,337 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2022-02-21 03:24:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2022-02-21 03:24:46,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:46,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:46,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:46,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:24:46,340 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:24:46,340 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:24:46,340 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:46,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:24:46,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:46,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:46,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:46,341 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:46,341 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:24:46,341 INFO L791 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 104#L19-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 94#L21-2 [2022-02-21 03:24:46,341 INFO L793 eck$LassoCheckResult]: Loop: 94#L21-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; 102#L21-2 assume !(main_~j~0#1 <= main_~i~0#1); 97#L21-3 main_~i~0#1 := 1 + main_~i~0#1; 93#L19-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 94#L21-2 [2022-02-21 03:24:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:24:46,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904080637] [2022-02-21 03:24:46,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,349 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1537394, now seen corresponding path program 1 times [2022-02-21 03:24:46,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664147315] [2022-02-21 03:24:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,355 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,360 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:46,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1810841241, now seen corresponding path program 1 times [2022-02-21 03:24:46,360 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:46,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447551803] [2022-02-21 03:24:46,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:46,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,368 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:46,372 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:46,402 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:46,402 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:46,402 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:46,403 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:46,403 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:46,403 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,403 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:46,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:46,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration2_Loop [2022-02-21 03:24:46,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:46,403 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:46,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:46,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:46,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:46,462 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:46,462 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:46,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,467 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:24:46,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:46,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:46,510 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:46,510 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: [] [2022-02-21 03:24:46,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,539 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:46,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:46,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:24:46,563 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:46,563 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:46,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,583 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:24:46,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:46,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:46,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:24:46,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,623 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:24:46,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:46,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:46,728 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:46,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,732 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:46,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:46,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:46,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:46,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:46,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:46,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:46,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration2_Loop [2022-02-21 03:24:46,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:46,732 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:46,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:46,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:46,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:46,806 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:46,807 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:46,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,808 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:46,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:46,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:46,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:46,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:46,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:46,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:46,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:24:46,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:46,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,860 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:24:46,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:46,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:46,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:46,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:46,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:46,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:46,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:46,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:46,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:46,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,902 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:24:46,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:46,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:46,915 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:46,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:46,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:46,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:46,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:46,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:46,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:46,934 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:46,934 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:46,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:46,935 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:46,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:24:46,937 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:46,937 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:46,937 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:46,937 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-02-21 03:24:46,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:24:46,957 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:46,961 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~j~0#1 <= main_~i~0#1);" "main_~i~0#1 := 1 + main_~i~0#1;" "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;" [2022-02-21 03:24:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:46,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:46,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#unseeded} assume { :begin_inline_ULTIMATE.init } true; {173#unseeded} is VALID [2022-02-21 03:24:46,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {173#unseeded} is VALID [2022-02-21 03:24:46,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {173#unseeded} is VALID [2022-02-21 03:24:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:47,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {176#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 03:24:47,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 <= main_~i~0#1); {176#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 03:24:47,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} main_~i~0#1 := 1 + main_~i~0#1; {203#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:24:47,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {203#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {186#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))) unseeded)} is VALID [2022-02-21 03:24:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:24:47,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:47,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:47,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,044 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 [2022-02-21 03:24:47,044 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,071 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 18 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 23 states and 32 transitions. Complement of second has 6 states. [2022-02-21 03:24:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:47,071 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:47,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:47,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:47,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2022-02-21 03:24:47,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:47,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,074 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:47,074 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:24:47,074 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,075 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:47,075 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:47,075 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 32 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:47,075 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:47,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:47,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:47,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:47,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:24:47,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:24:47,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 23 letters. [2022-02-21 03:24:47,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:47,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:47,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:47,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:47,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:47,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:47,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:47,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:47,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:47,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:47,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:47,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:47,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:47,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:47,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:47,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:47,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 32 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,084 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-02-21 03:24:47,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:47,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:47,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2022-02-21 03:24:47,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:47,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:47,087 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 16 states and 23 transitions. [2022-02-21 03:24:47,087 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:24:47,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:47,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2022-02-21 03:24:47,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:47,088 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2022-02-21 03:24:47,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2022-02-21 03:24:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-02-21 03:24:47,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:47,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,089 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,089 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,089 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:47,090 INFO L93 Difference]: Finished difference Result 17 states and 25 transitions. [2022-02-21 03:24:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 25 transitions. [2022-02-21 03:24:47,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:47,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:47,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 23 transitions. [2022-02-21 03:24:47,091 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 23 transitions. [2022-02-21 03:24:47,091 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:47,092 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. [2022-02-21 03:24:47,092 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 29 transitions. [2022-02-21 03:24:47,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:47,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:47,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:47,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2022-02-21 03:24:47,093 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2022-02-21 03:24:47,093 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2022-02-21 03:24:47,093 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:47,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2022-02-21 03:24:47,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:47,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,094 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:24:47,094 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:47,094 INFO L791 eck$LassoCheckResult]: Stem: 244#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 245#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 239#L19-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 241#L21-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; 246#L21-2 [2022-02-21 03:24:47,094 INFO L793 eck$LassoCheckResult]: Loop: 246#L21-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; 246#L21-2 [2022-02-21 03:24:47,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash 925804, now seen corresponding path program 1 times [2022-02-21 03:24:47,095 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:47,095 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733442987] [2022-02-21 03:24:47,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:47,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,118 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:47,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:47,118 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2022-02-21 03:24:47,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:47,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310555173] [2022-02-21 03:24:47,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:47,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,127 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash 28699944, now seen corresponding path program 2 times [2022-02-21 03:24:47,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:47,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661494227] [2022-02-21 03:24:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,132 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,135 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:47,145 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:47,146 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:47,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:47,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:47,146 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:47,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:47,146 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:47,146 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration3_Loop [2022-02-21 03:24:47,146 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:47,146 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:47,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,184 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:47,184 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:47,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,200 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:24:47,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:47,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,243 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:47,244 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: [] [2022-02-21 03:24:47,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 03:24:47,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,260 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:24:47,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:47,261 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,294 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:24:47,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:47,297 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,407 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:47,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,410 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:47,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:47,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:47,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:47,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:47,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:47,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:47,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration3_Loop [2022-02-21 03:24:47,410 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:47,410 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:47,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,468 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:47,468 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:47,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,469 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:24:47,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:47,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:47,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:47,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:47,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:47,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:47,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:47,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:47,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:24:47,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,507 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:24:47,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:47,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:47,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:47,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:47,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:47,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:47,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:47,518 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:47,519 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:47,521 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:47,521 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:47,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,522 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:24:47,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:47,524 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:47,524 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:47,524 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 2*ULTIMATE.start_main_~i~0#1 - 2*ULTIMATE.start_main_~j~0#1 + 1 Supporting invariants [] [2022-02-21 03:24:47,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,553 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:47,557 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1;" [2022-02-21 03:24:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:47,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {330#unseeded} assume { :begin_inline_ULTIMATE.init } true; {330#unseeded} is VALID [2022-02-21 03:24:47,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {330#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {330#unseeded} is VALID [2022-02-21 03:24:47,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {330#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {330#unseeded} is VALID [2022-02-21 03:24:47,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {330#unseeded} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {330#unseeded} is VALID [2022-02-21 03:24:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,602 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:47,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:47,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {343#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:24:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:47,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:47,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,609 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 [2022-02-21 03:24:47,610 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 10 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,673 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 10. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 39 transitions. Complement of second has 5 states. [2022-02-21 03:24:47,674 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 [2022-02-21 03:24:47,674 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:47,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:47,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:47,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 39 transitions. [2022-02-21 03:24:47,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:47,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,676 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 22 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:47,676 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:47,676 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:47,677 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:47,677 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 39 transitions. cyclomatic complexity: 19 [2022-02-21 03:24:47,677 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:47,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:47,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:47,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:24:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:24:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:24:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:47,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:47,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:47,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 22 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:47,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,684 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:24:47,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:47,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:47,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:47,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:47,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 39 transitions. cyclomatic complexity: 19 [2022-02-21 03:24:47,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:47,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 34 transitions. [2022-02-21 03:24:47,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:47,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:47,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 34 transitions. [2022-02-21 03:24:47,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:47,688 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-02-21 03:24:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 34 transitions. [2022-02-21 03:24:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-02-21 03:24:47,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:47,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,689 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,689 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,689 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:47,690 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2022-02-21 03:24:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions. [2022-02-21 03:24:47,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:47,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:47,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states and 34 transitions. [2022-02-21 03:24:47,691 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states and 34 transitions. [2022-02-21 03:24:47,691 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:47,693 INFO L93 Difference]: Finished difference Result 24 states and 36 transitions. [2022-02-21 03:24:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions. [2022-02-21 03:24:47,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:47,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:47,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:47,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2022-02-21 03:24:47,694 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-02-21 03:24:47,694 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-02-21 03:24:47,694 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:47,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2022-02-21 03:24:47,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:47,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:47,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:47,695 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2022-02-21 03:24:47,695 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:47,695 INFO L791 eck$LassoCheckResult]: Stem: 397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 398#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 391#L19-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 393#L21-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; 399#L21-2 assume !(main_~j~0#1 <= main_~i~0#1); 408#L21-3 main_~i~0#1 := 1 + main_~i~0#1; 406#L19-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 402#L21-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; 401#L21-2 [2022-02-21 03:24:47,696 INFO L793 eck$LassoCheckResult]: Loop: 401#L21-2 assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; 401#L21-2 [2022-02-21 03:24:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 301503643, now seen corresponding path program 2 times [2022-02-21 03:24:47,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:47,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397479238] [2022-02-21 03:24:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:47,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,705 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,710 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:47,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:47,711 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2022-02-21 03:24:47,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:47,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198812709] [2022-02-21 03:24:47,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:47,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,714 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,716 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:47,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash 756678361, now seen corresponding path program 3 times [2022-02-21 03:24:47,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:47,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644732584] [2022-02-21 03:24:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:47,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:47,733 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:47,746 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:47,746 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:47,746 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:47,746 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:47,747 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:47,747 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,747 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:47,747 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:47,747 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration4_Loop [2022-02-21 03:24:47,747 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:47,747 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:47,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,789 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:47,789 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:47,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,791 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:24:47,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:47,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:47,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:47,833 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:47,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:24:47,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:47,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:47,949 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:47,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:24:47,953 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:47,953 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:47,953 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:47,953 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:47,953 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:47,953 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,953 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:47,953 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:47,953 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration4_Loop [2022-02-21 03:24:47,953 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:47,953 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:47,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:47,999 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:47,999 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:47,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:47,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,000 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:24:48,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:48,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:48,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:48,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:48,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:48,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:48,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:48,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:48,022 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:48,024 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:48,024 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:48,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:48,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:48,068 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:48,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:24:48,070 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:48,070 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:48,070 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:48,070 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2022-02-21 03:24:48,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:24:48,104 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:48,107 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1;" [2022-02-21 03:24:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:48,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#unseeded} assume { :begin_inline_ULTIMATE.init } true; {506#unseeded} is VALID [2022-02-21 03:24:48,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {506#unseeded} is VALID [2022-02-21 03:24:48,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {506#unseeded} is VALID [2022-02-21 03:24:48,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#unseeded} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#unseeded} assume !(main_~j~0#1 <= main_~i~0#1); {506#unseeded} is VALID [2022-02-21 03:24:48,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {506#unseeded} is VALID [2022-02-21 03:24:48,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#unseeded} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,153 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:48,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {509#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {519#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:24:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:48,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:48,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,171 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 [2022-02-21 03:24:48,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,186 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 36 transitions. Complement of second has 5 states. [2022-02-21 03:24:48,186 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 [2022-02-21 03:24:48,186 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:48,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2022-02-21 03:24:48,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,187 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,188 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 36 transitions. cyclomatic complexity: 17 [2022-02-21 03:24:48,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,190 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:24:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,191 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:48,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:48,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#unseeded} assume { :begin_inline_ULTIMATE.init } true; {506#unseeded} is VALID [2022-02-21 03:24:48,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {506#unseeded} is VALID [2022-02-21 03:24:48,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {506#unseeded} is VALID [2022-02-21 03:24:48,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#unseeded} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#unseeded} assume !(main_~j~0#1 <= main_~i~0#1); {506#unseeded} is VALID [2022-02-21 03:24:48,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {506#unseeded} is VALID [2022-02-21 03:24:48,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#unseeded} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,296 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:48,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {509#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {519#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:24:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:48,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:48,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,303 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 [2022-02-21 03:24:48,303 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,321 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 36 transitions. Complement of second has 5 states. [2022-02-21 03:24:48,321 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 [2022-02-21 03:24:48,321 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:48,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2022-02-21 03:24:48,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,322 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,322 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,322 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,322 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,322 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 36 transitions. cyclomatic complexity: 17 [2022-02-21 03:24:48,323 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 36 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,325 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:24:48,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,326 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:48,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:48,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#unseeded} assume { :begin_inline_ULTIMATE.init } true; {506#unseeded} is VALID [2022-02-21 03:24:48,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_~i~0#1, main_~j~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~n~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {506#unseeded} is VALID [2022-02-21 03:24:48,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {506#unseeded} is VALID [2022-02-21 03:24:48,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#unseeded} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,358 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#unseeded} assume !(main_~j~0#1 <= main_~i~0#1); {506#unseeded} is VALID [2022-02-21 03:24:48,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {506#unseeded} is VALID [2022-02-21 03:24:48,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#unseeded} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {506#unseeded} is VALID [2022-02-21 03:24:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,362 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:48,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:48,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {509#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))} assume !!(main_~j~0#1 <= main_~i~0#1);main_~j~0#1 := 1 + main_~j~0#1; {519#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~j~0#1|) (* 2 |ULTIMATE.start_main_~i~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:24:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:48,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:48,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,369 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 [2022-02-21 03:24:48,369 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,383 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 31 transitions. Complement of second has 4 states. [2022-02-21 03:24:48,384 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 [2022-02-21 03:24:48,384 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:48,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:48,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:48,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2022-02-21 03:24:48,385 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:48,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:48,385 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,385 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,385 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:48,385 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:48,385 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:48,385 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:48,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:48,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:48,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,408 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:24:48,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:48,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:48,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:48,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:48,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:48,411 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:48,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2022-02-21 03:24:48,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:48,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:48,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:48,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:48,411 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:48,411 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:48,411 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:48,411 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:48,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:48,411 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:48,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:48,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:48 BoogieIcfgContainer [2022-02-21 03:24:48,416 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:48,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:48,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:48,417 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:48,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:44" (3/4) ... [2022-02-21 03:24:48,418 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:48,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:48,419 INFO L158 Benchmark]: Toolchain (without parser) took 3833.79ms. Allocated memory was 86.0MB in the beginning and 134.2MB in the end (delta: 48.2MB). Free memory was 51.9MB in the beginning and 107.2MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:48,420 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory was 56.2MB in the beginning and 56.2MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:48,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.68ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 51.7MB in the beginning and 88.1MB in the end (delta: -36.4MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-21 03:24:48,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.85ms. Allocated memory is still 111.1MB. Free memory was 88.1MB in the beginning and 86.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:48,420 INFO L158 Benchmark]: Boogie Preprocessor took 19.63ms. Allocated memory is still 111.1MB. Free memory was 86.7MB in the beginning and 86.0MB in the end (delta: 703.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:48,420 INFO L158 Benchmark]: RCFGBuilder took 170.47ms. Allocated memory is still 111.1MB. Free memory was 86.0MB in the beginning and 77.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:48,421 INFO L158 Benchmark]: BuchiAutomizer took 3418.51ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 77.6MB in the beginning and 108.3MB in the end (delta: -30.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:48,421 INFO L158 Benchmark]: Witness Printer took 2.17ms. Allocated memory is still 134.2MB. Free memory was 108.3MB in the beginning and 107.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:48,422 INFO L339 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.21ms. Allocated memory is still 86.0MB. Free memory was 56.2MB in the beginning and 56.2MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.68ms. Allocated memory was 86.0MB in the beginning and 111.1MB in the end (delta: 25.2MB). Free memory was 51.7MB in the beginning and 88.1MB in the end (delta: -36.4MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.85ms. Allocated memory is still 111.1MB. Free memory was 88.1MB in the beginning and 86.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.63ms. Allocated memory is still 111.1MB. Free memory was 86.7MB in the beginning and 86.0MB in the end (delta: 703.1kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 170.47ms. Allocated memory is still 111.1MB. Free memory was 86.0MB in the beginning and 77.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3418.51ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 77.6MB in the beginning and 108.3MB in the end (delta: -30.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.17ms. Allocated memory is still 134.2MB. Free memory was 108.3MB in the beginning and 107.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * i + n and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 2 * i + 1 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 2 * i + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 32 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax191 hnf100 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf110 neg98 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s [2022-02-21 03:24:48,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:48,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE