./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.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/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.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 086de8df2449d866ff611c83674a9697b7d09f2a2b1c5c922e46b0c1131a7d5c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:38,391 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:38,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:38,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:38,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:38,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:38,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:38,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:38,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:38,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:38,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:38,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:38,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:38,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:38,436 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:38,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:38,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:38,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:38,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:38,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:38,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:38,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:38,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:38,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:38,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:38,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:38,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:38,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:38,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:38,456 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:38,456 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:38,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:38,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:38,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:38,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:38,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:38,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:38,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:38,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:38,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:38,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:38,462 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:38,494 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:38,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:38,497 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:38,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:38,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:38,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:38,499 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:38,499 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:38,499 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:38,503 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:38,503 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:38,504 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:38,504 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:38,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:38,504 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:38,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:38,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:38,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:38,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:38,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:38,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:38,505 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:38,505 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:38,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:38,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:38,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:38,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:38,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:38,507 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:38,507 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 -> 086de8df2449d866ff611c83674a9697b7d09f2a2b1c5c922e46b0c1131a7d5c [2022-02-21 03:24:38,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:38,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:38,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:38,722 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:38,723 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:38,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2022-02-21 03:24:38,771 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df3db1412/bfb5238958ad4891b39a2b2850fbf37e/FLAG22b28d1d4 [2022-02-21 03:24:39,119 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:39,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2022-02-21 03:24:39,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df3db1412/bfb5238958ad4891b39a2b2850fbf37e/FLAG22b28d1d4 [2022-02-21 03:24:39,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df3db1412/bfb5238958ad4891b39a2b2850fbf37e [2022-02-21 03:24:39,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:39,154 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:39,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:39,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:39,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:39,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:39" (1/1) ... [2022-02-21 03:24:39,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7ac183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:39, skipping insertion in model container [2022-02-21 03:24:39,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:39" (1/1) ... [2022-02-21 03:24:39,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:39,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:39,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:39,279 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:39,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:39,309 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:39,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:39 WrapperNode [2022-02-21 03:24:39,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:39,310 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:39,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:39,311 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:39,320 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:39" (1/1) ... [2022-02-21 03:24:39,324 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:39" (1/1) ... [2022-02-21 03:24:39,341 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-02-21 03:24:39,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:39,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:39,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:39,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:39,348 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:39" (1/1) ... [2022-02-21 03:24:39,349 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:39" (1/1) ... [2022-02-21 03:24:39,350 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:39" (1/1) ... [2022-02-21 03:24:39,350 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:39" (1/1) ... [2022-02-21 03:24:39,353 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:39" (1/1) ... [2022-02-21 03:24:39,358 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:39" (1/1) ... [2022-02-21 03:24:39,359 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:39" (1/1) ... [2022-02-21 03:24:39,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:39,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:39,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:39,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:39,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:39" (1/1) ... [2022-02-21 03:24:39,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,388 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:39,392 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:39,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:39,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:39,476 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:39,478 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:39,605 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:39,612 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:39,612 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:24:39,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:39 BoogieIcfgContainer [2022-02-21 03:24:39,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:39,615 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:39,615 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:39,617 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:39,618 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:39,619 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:39" (1/3) ... [2022-02-21 03:24:39,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e562e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:39, skipping insertion in model container [2022-02-21 03:24:39,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:39,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:39" (2/3) ... [2022-02-21 03:24:39,620 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e562e5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:39, skipping insertion in model container [2022-02-21 03:24:39,620 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:39,620 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:39" (3/3) ... [2022-02-21 03:24:39,622 INFO L388 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c [2022-02-21 03:24:39,705 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:39,705 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:39,705 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:39,705 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:39,705 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:39,705 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:39,705 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:39,705 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:39,724 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:39,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:39,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:39,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:39,746 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:39,746 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:39,746 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:39,746 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:39,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:39,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:39,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:39,748 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:39,748 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:39,758 INFO L791 eck$LassoCheckResult]: Stem: 5#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 4#L17true assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; 8#L21-2true [2022-02-21 03:24:39,758 INFO L793 eck$LassoCheckResult]: Loop: 8#L21-2true assume !!(main_~v1~0#1 > 0); 6#L21true assume main_~v2~0#1 < main_~m~0#1;main_~v2~0#1 := 1 + main_~v2~0#1;main_~v1~0#1 := main_~v1~0#1 - 1; 8#L21-2true [2022-02-21 03:24:39,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 03:24:39,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:39,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723895067] [2022-02-21 03:24:39,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,859 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 1 times [2022-02-21 03:24:39,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:39,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852805222] [2022-02-21 03:24:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,877 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,890 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 28693989, now seen corresponding path program 1 times [2022-02-21 03:24:39,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:39,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532618861] [2022-02-21 03:24:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,923 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:39,994 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:39,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:39,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:39,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:39,995 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:40,001 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:40,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:40,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c_Iteration1_Loop [2022-02-21 03:24:40,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:40,002 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:40,015 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:40,023 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:40,027 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:40,038 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:40,126 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:40,127 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:40,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,130 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:40,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,150 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:40,160 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:40,161 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:40,179 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:40,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,183 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:40,192 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:40,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,215 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:40,216 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:40,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:24:40,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,235 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:40,235 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:40,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:40,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,276 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:40,277 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:40,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:40,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,319 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:40,326 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:40,327 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:40,327 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:40,327 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:40,327 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:40,327 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:40,327 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,327 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:40,327 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:40,327 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c_Iteration1_Loop [2022-02-21 03:24:40,327 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:40,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:40,328 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:40,332 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:40,336 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:40,342 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:40,425 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:40,428 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:40,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,448 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:40,489 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:40,489 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:40,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:40,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:40,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:40,535 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:40,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,536 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:40,538 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:40,539 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:40,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,548 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:40,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:40,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:40,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 03:24:40,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,578 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:40,578 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:40,580 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:40,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:40,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,588 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:40,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:40,590 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:40,592 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:40,593 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:40,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,595 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:40,599 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:40,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:40,600 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:40,600 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:40,601 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v1~0#1) = 1*ULTIMATE.start_main_~v1~0#1 Supporting invariants [] [2022-02-21 03:24:40,618 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:40,631 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:40,635 INFO L390 LassoCheck]: Loop: "assume !!(main_~v1~0#1 > 0);" "assume main_~v2~0#1 < main_~m~0#1;main_~v2~0#1 := 1 + main_~v2~0#1;main_~v1~0#1 := main_~v1~0#1 - 1;" [2022-02-21 03:24:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#unseeded} assume { :begin_inline_ULTIMATE.init } true; {19#unseeded} is VALID [2022-02-21 03:24:40,688 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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {19#unseeded} is VALID [2022-02-21 03:24:40,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#unseeded} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {19#unseeded} is VALID [2022-02-21 03:24:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,695 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#(>= oldRank0 |ULTIMATE.start_main_~v1~0#1|)} assume !!(main_~v1~0#1 > 0); {43#(and (>= oldRank0 |ULTIMATE.start_main_~v1~0#1|) (< 0 |ULTIMATE.start_main_~v1~0#1|))} is VALID [2022-02-21 03:24:40,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (>= oldRank0 |ULTIMATE.start_main_~v1~0#1|) (< 0 |ULTIMATE.start_main_~v1~0#1|))} assume main_~v2~0#1 < main_~m~0#1;main_~v2~0#1 := 1 + main_~v2~0#1;main_~v1~0#1 := main_~v1~0#1 - 1; {32#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~v1~0#1|)) unseeded)} is VALID [2022-02-21 03:24:40,719 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:40,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:40,741 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:40,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,746 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:40,747 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:40,793 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 26 states and 34 transitions. Complement of second has 7 states. [2022-02-21 03:24:40,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:40,794 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,794 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:40,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:40,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:40,797 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:40,797 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,797 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2022-02-21 03:24:40,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:40,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,800 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:40,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:40,801 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:40,801 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:40,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:40,802 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:40,802 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 34 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:40,803 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:40,803 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 2 letters. [2022-02-21 03:24:40,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:40,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,804 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 2 letters. [2022-02-21 03:24:40,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:40,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,805 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 2 letters. [2022-02-21 03:24:40,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:40,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,806 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 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,807 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:40,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:40,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:40,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,807 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 5 letters. [2022-02-21 03:24:40,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 5 letters. [2022-02-21 03:24:40,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:40,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,808 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 2 letters. [2022-02-21 03:24:40,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:40,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,809 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 2 letters. [2022-02-21 03:24:40,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:40,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,810 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:40,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:40,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:40,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,811 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 2 letters. [2022-02-21 03:24:40,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:40,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,812 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 2 letters. [2022-02-21 03:24:40,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:40,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,813 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 2 letters. [2022-02-21 03:24:40,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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 2 letters. [2022-02-21 03:24:40,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 34 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:40,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,813 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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:40,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 03:24:40,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:40,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:40,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:40,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 34 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:40,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:40,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 10 states and 13 transitions. [2022-02-21 03:24:40,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:40,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:24:40,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-02-21 03:24:40,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:40,825 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:24:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-02-21 03:24:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-02-21 03:24:40,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:40,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) 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:40,840 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) 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:40,841 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) 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:40,843 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,845 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2022-02-21 03:24:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:24:40,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.3333333333333333) 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 10 states and 13 transitions. [2022-02-21 03:24:40,846 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.3333333333333333) 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 10 states and 13 transitions. [2022-02-21 03:24:40,846 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,847 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2022-02-21 03:24:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-02-21 03:24:40,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:40,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) 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:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-02-21 03:24:40,849 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:40,849 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:40,849 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:40,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:40,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:40,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,850 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:24:40,850 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:40,850 INFO L791 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 86#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 83#L17 assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; 84#L21-2 assume !!(main_~v1~0#1 > 0); 87#L21 [2022-02-21 03:24:40,850 INFO L793 eck$LassoCheckResult]: Loop: 87#L21 assume !(main_~v2~0#1 < main_~m~0#1);main_~v2~0#1 := 0; 88#L21-2 assume !!(main_~v1~0#1 > 0); 87#L21 [2022-02-21 03:24:40,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash 925612, now seen corresponding path program 1 times [2022-02-21 03:24:40,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859887464] [2022-02-21 03:24:40,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,856 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,858 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1564, now seen corresponding path program 1 times [2022-02-21 03:24:40,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256089822] [2022-02-21 03:24:40,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,890 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:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,894 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 889513735, now seen corresponding path program 1 times [2022-02-21 03:24:40,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231123841] [2022-02-21 03:24:40,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#true} assume { :begin_inline_ULTIMATE.init } true; {147#true} is VALID [2022-02-21 03:24:40,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} 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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {147#true} is VALID [2022-02-21 03:24:40,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {149#(<= (+ |ULTIMATE.start_main_~v2~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:24:40,935 INFO L290 TraceCheckUtils]: 3: Hoare triple {149#(<= (+ |ULTIMATE.start_main_~v2~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~v1~0#1 > 0); {149#(<= (+ |ULTIMATE.start_main_~v2~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 03:24:40,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {149#(<= (+ |ULTIMATE.start_main_~v2~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(main_~v2~0#1 < main_~m~0#1);main_~v2~0#1 := 0; {148#false} is VALID [2022-02-21 03:24:40,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#false} assume !!(main_~v1~0#1 > 0); {148#false} is VALID [2022-02-21 03:24:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:40,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:40,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231123841] [2022-02-21 03:24:40,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231123841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:40,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:40,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:24:40,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317748266] [2022-02-21 03:24:40,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:40,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:24:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:24:40,966 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:40,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:40,979 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 03:24:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:24:40,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:40,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:40,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2022-02-21 03:24:40,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:40,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 10 states and 12 transitions. [2022-02-21 03:24:40,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:40,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:40,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2022-02-21 03:24:40,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:40,992 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:24:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2022-02-21 03:24:40,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-21 03:24:40,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:40,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 12 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:40,994 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 12 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:40,995 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:40,995 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,996 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2022-02-21 03:24:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:24:40,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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 10 states and 12 transitions. [2022-02-21 03:24:40,997 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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 10 states and 12 transitions. [2022-02-21 03:24:40,997 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,999 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2022-02-21 03:24:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:24:40,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:40,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:40,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 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:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2022-02-21 03:24:41,001 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:24:41,001 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2022-02-21 03:24:41,001 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:41,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:24:41,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2022-02-21 03:24:41,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:41,003 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 164#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 161#L17 assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; 162#L21-2 assume !!(main_~v1~0#1 > 0); 167#L21 assume main_~v2~0#1 < main_~m~0#1;main_~v2~0#1 := 1 + main_~v2~0#1;main_~v1~0#1 := main_~v1~0#1 - 1; 168#L21-2 assume !!(main_~v1~0#1 > 0); 165#L21 [2022-02-21 03:24:41,003 INFO L793 eck$LassoCheckResult]: Loop: 165#L21 assume !(main_~v2~0#1 < main_~m~0#1);main_~v2~0#1 := 0; 166#L21-2 assume !!(main_~v1~0#1 > 0); 165#L21 [2022-02-21 03:24:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 889513673, now seen corresponding path program 2 times [2022-02-21 03:24:41,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396641261] [2022-02-21 03:24:41,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,016 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1564, now seen corresponding path program 2 times [2022-02-21 03:24:41,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705208976] [2022-02-21 03:24:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,020 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,022 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash 124148452, now seen corresponding path program 1 times [2022-02-21 03:24:41,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026430253] [2022-02-21 03:24:41,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,033 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,044 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,104 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,105 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,105 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,105 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,105 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:41,105 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,105 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,105 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,105 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c_Iteration3_Lasso [2022-02-21 03:24:41,105 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,106 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,107 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:41,110 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:41,112 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:41,118 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:41,121 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:41,123 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:41,126 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:41,199 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,199 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:41,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,200 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:41,203 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:41,204 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,215 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:41,216 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:41,232 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:41,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,233 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:41,234 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:41,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,243 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:41,243 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:41,259 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:41,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,261 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:41,261 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:41,263 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,294 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:41,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,300 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:41,301 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:41,303 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:41,303 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,376 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:41,379 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:41,379 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,380 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:41,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2.c_Iteration3_Lasso [2022-02-21 03:24:41,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,380 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,381 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:41,389 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:41,392 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:41,393 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:41,403 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:41,406 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:41,408 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:41,528 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,528 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:41,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,554 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:41,555 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:41,557 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:41,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:41,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:41,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:41,591 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:41,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,593 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:41,593 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:41,595 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:41,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:41,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:41,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:41,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:41,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:24:41,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,633 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:41,634 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:41,635 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:41,641 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:41,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,642 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:41,642 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:41,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:41,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,670 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:41,671 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:41,673 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:41,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,682 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:41,682 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:41,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:41,709 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:24:41,709 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:24:41,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,711 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:41,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:41,765 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:41,768 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:24:41,769 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:41,769 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v2~0#1, ULTIMATE.start_main_~m~0#1) = 2*ULTIMATE.start_main_~v2~0#1 - 2*ULTIMATE.start_main_~m~0#1 + 1 Supporting invariants [1*ULTIMATE.start_main_~m~0#1 - 1 >= 0] [2022-02-21 03:24:41,784 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:41,801 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:24:41,807 INFO L390 LassoCheck]: Loop: "assume !(main_~v2~0#1 < main_~m~0#1);main_~v2~0#1 := 0;" "assume !!(main_~v1~0#1 > 0);" [2022-02-21 03:24:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,868 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:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#unseeded} assume { :begin_inline_ULTIMATE.init } true; {232#unseeded} is VALID [2022-02-21 03:24:41,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {232#unseeded} is VALID [2022-02-21 03:24:41,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#unseeded} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:41,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !!(main_~v1~0#1 > 0); {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:41,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume main_~v2~0#1 < main_~m~0#1;main_~v2~0#1 := 1 + main_~v2~0#1;main_~v1~0#1 := main_~v1~0#1 - 1; {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:41,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !!(main_~v1~0#1 > 0); {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,918 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~v2~0#1|) (* (- 2) |ULTIMATE.start_main_~m~0#1|) 1)) (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !(main_~v2~0#1 < main_~m~0#1);main_~v2~0#1 := 0; {275#(and (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= |ULTIMATE.start_main_~v2~0#1| 0))} is VALID [2022-02-21 03:24:41,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#(and (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= |ULTIMATE.start_main_~v2~0#1| 0))} assume !!(main_~v1~0#1 > 0); {254#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~v2~0#1|) (* (- 2) |ULTIMATE.start_main_~m~0#1|) 1)))) (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:41,969 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:41,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:41,974 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:41,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:41,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,974 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:24:41,975 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,003 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10 states and 12 transitions. Complement of second has 4 states. [2022-02-21 03:24:42,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,004 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:42,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,005 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:24:42,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:42,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 2 [2022-02-21 03:24:42,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,007 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:42,007 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:42,007 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2022-02-21 03:24:42,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,013 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:42,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#unseeded} assume { :begin_inline_ULTIMATE.init } true; {232#unseeded} is VALID [2022-02-21 03:24:42,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {232#unseeded} is VALID [2022-02-21 03:24:42,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#unseeded} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !!(main_~v1~0#1 > 0); {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume main_~v2~0#1 < main_~m~0#1;main_~v2~0#1 := 1 + main_~v2~0#1;main_~v1~0#1 := main_~v1~0#1 - 1; {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !!(main_~v1~0#1 > 0); {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,092 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~v2~0#1|) (* (- 2) |ULTIMATE.start_main_~m~0#1|) 1)) (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !(main_~v2~0#1 < main_~m~0#1);main_~v2~0#1 := 0; {316#(and (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= |ULTIMATE.start_main_~v2~0#1| 0))} is VALID [2022-02-21 03:24:42,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#(and (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= |ULTIMATE.start_main_~v2~0#1| 0))} assume !!(main_~v1~0#1 > 0); {254#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~v2~0#1|) (* (- 2) |ULTIMATE.start_main_~m~0#1|) 1)))) (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,135 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:42,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,140 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:42,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,141 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:24:42,141 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10 states and 12 transitions. Complement of second has 4 states. [2022-02-21 03:24:42,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,171 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:42,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,171 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:24:42,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,172 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:42,172 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,172 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,173 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states and 4 transitions. cyclomatic complexity: 2 [2022-02-21 03:24:42,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,173 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:42,173 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:42,173 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,177 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2022-02-21 03:24:42,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,178 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:42,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#unseeded} assume { :begin_inline_ULTIMATE.init } true; {232#unseeded} is VALID [2022-02-21 03:24:42,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#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_~m~0#1, main_~n~0#1, main_~v1~0#1, main_~v2~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~v1~0#1;havoc main_~v2~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {232#unseeded} is VALID [2022-02-21 03:24:42,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#unseeded} assume main_~n~0#1 >= 0 && main_~m~0#1 > 0;main_~v1~0#1 := main_~n~0#1;main_~v2~0#1 := 0; {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !!(main_~v1~0#1 > 0); {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume main_~v2~0#1 < main_~m~0#1;main_~v2~0#1 := 1 + main_~v2~0#1;main_~v1~0#1 := main_~v1~0#1 - 1; {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !!(main_~v1~0#1 > 0); {251#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,256 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~v2~0#1|) (* (- 2) |ULTIMATE.start_main_~m~0#1|) 1)) (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !(main_~v2~0#1 < main_~m~0#1);main_~v2~0#1 := 0; {357#(and (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= |ULTIMATE.start_main_~v2~0#1| 0))} is VALID [2022-02-21 03:24:42,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#(and (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= |ULTIMATE.start_main_~v2~0#1| 0))} assume !!(main_~v1~0#1 > 0); {254#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~v2~0#1|) (* (- 2) |ULTIMATE.start_main_~m~0#1|) 1)))) (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:42,297 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:42,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,302 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:42,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,302 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:24:42,303 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 12 transitions. cyclomatic complexity: 4. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 14 states and 17 transitions. Complement of second has 5 states. [2022-02-21 03:24:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,350 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:42,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:24:42,353 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,353 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:42,353 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,353 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,354 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,355 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,355 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,355 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:42,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:42,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 14 letters. Loop has 14 letters. [2022-02-21 03:24:42,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:42,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:42,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,362 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-02-21 03:24:42,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:42,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2022-02-21 03:24:42,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:42,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:42,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:42,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:42,368 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:42,368 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:42,368 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:42,368 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:42,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:42,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:42 BoogieIcfgContainer [2022-02-21 03:24:42,374 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:42,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:42,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:42,375 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:42,375 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:39" (3/4) ... [2022-02-21 03:24:42,377 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:42,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:42,381 INFO L158 Benchmark]: Toolchain (without parser) took 3224.13ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 75.7MB in the beginning and 88.9MB in the end (delta: -13.3MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,381 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 79.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:42,382 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.47ms. Allocated memory is still 96.5MB. Free memory was 75.7MB in the beginning and 66.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,382 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.52ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 65.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:42,382 INFO L158 Benchmark]: Boogie Preprocessor took 17.00ms. Allocated memory is still 96.5MB. Free memory was 65.4MB in the beginning and 64.5MB in the end (delta: 953.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,383 INFO L158 Benchmark]: RCFGBuilder took 253.05ms. Allocated memory is still 96.5MB. Free memory was 64.5MB in the beginning and 55.8MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,387 INFO L158 Benchmark]: BuchiAutomizer took 2759.48ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 55.8MB in the beginning and 89.9MB in the end (delta: -34.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:42,388 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 88.9MB in the end (delta: 981.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:42,389 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.18ms. Allocated memory is still 79.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.47ms. Allocated memory is still 96.5MB. Free memory was 75.7MB in the beginning and 66.8MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.52ms. Allocated memory is still 96.5MB. Free memory was 66.8MB in the beginning and 65.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.00ms. Allocated memory is still 96.5MB. Free memory was 65.4MB in the beginning and 64.5MB in the end (delta: 953.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 253.05ms. Allocated memory is still 96.5MB. Free memory was 64.5MB in the beginning and 55.8MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2759.48ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 55.8MB in the beginning and 89.9MB in the end (delta: -34.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 88.9MB in the end (delta: 981.3kB). 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 3 terminating modules (1 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function v1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * v2 + -2 * m + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. 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 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 29 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax156 hnf100 lsp36 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf92 smp100 dnf100 smp100 tf106 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 87ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:42,414 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