./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/MultCommutative-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/recursive/MultCommutative-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:19:17,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:19:17,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:19:17,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:19:17,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:19:17,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:19:17,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:19:17,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:19:17,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:19:17,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:19:17,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:19:17,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:19:17,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:19:17,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:19:17,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:19:17,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:19:17,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:19:17,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:19:17,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:19:17,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:19:17,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:19:17,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:19:17,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:19:17,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:19:17,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:19:17,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:19:17,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:19:17,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:19:17,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:19:17,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:19:17,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:19:17,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:19:17,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:19:17,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:19:17,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:19:17,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:19:17,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:19:17,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:19:17,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:19:17,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:19:17,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:19:17,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:19:17,306 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:19:17,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:19:17,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:19:17,307 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:19:17,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:19:17,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:19:17,308 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:19:17,308 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:19:17,308 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:19:17,309 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:19:17,309 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:19:17,309 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:19:17,309 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:19:17,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:19:17,310 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:19:17,310 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:19:17,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:19:17,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:19:17,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:19:17,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:19:17,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:19:17,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:19:17,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:19:17,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:19:17,311 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:19:17,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:19:17,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:19:17,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:19:17,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:19:17,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:19:17,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:19:17,313 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:19:17,313 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce29b37e076ab683230ebf17073db3b7759ea39570dd2ef64322b6d43bb636cd [2022-02-21 04:19:17,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:19:17,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:19:17,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:19:17,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:19:17,533 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:19:17,533 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/MultCommutative-2.c [2022-02-21 04:19:17,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2eb352f1/6350caf3d91f4207967f42b1afb6cdae/FLAGfe9d0bd8a [2022-02-21 04:19:17,873 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:19:17,873 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c [2022-02-21 04:19:17,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2eb352f1/6350caf3d91f4207967f42b1afb6cdae/FLAGfe9d0bd8a [2022-02-21 04:19:18,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2eb352f1/6350caf3d91f4207967f42b1afb6cdae [2022-02-21 04:19:18,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:19:18,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:19:18,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:18,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:19:18,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:19:18,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c8095f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18, skipping insertion in model container [2022-02-21 04:19:18,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,323 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:19:18,332 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:19:18,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2022-02-21 04:19:18,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:18,508 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:19:18,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/MultCommutative-2.c[970,983] [2022-02-21 04:19:18,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:19:18,538 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:19:18,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18 WrapperNode [2022-02-21 04:19:18,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:19:18,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:18,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:19:18,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:19:18,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,568 INFO L137 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-02-21 04:19:18,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:19:18,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:19:18,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:19:18,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:19:18,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:19:18,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:19:18,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:19:18,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:19:18,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (1/1) ... [2022-02-21 04:19:18,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:18,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:18,622 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 04:19:18,641 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 04:19:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:19:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2022-02-21 04:19:18,658 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2022-02-21 04:19:18,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:19:18,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:19:18,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:19:18,705 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:19:18,707 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:19:18,816 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:19:18,821 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:19:18,827 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 04:19:18,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:18 BoogieIcfgContainer [2022-02-21 04:19:18,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:19:18,829 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:19:18,831 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:19:18,833 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:19:18,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:18,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:19:18" (1/3) ... [2022-02-21 04:19:18,835 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@392750bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:18, skipping insertion in model container [2022-02-21 04:19:18,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:18,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:19:18" (2/3) ... [2022-02-21 04:19:18,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@392750bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:19:18, skipping insertion in model container [2022-02-21 04:19:18,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:19:18,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:18" (3/3) ... [2022-02-21 04:19:18,844 INFO L388 chiAutomizerObserver]: Analyzing ICFG MultCommutative-2.c [2022-02-21 04:19:18,892 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:19:18,893 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:19:18,893 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:19:18,893 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:19:18,893 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:19:18,893 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:19:18,893 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:19:18,893 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:19:18,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:18,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:19:18,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:18,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:18,934 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:19:18,934 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:19:18,934 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:19:18,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:18,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:19:18,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:18,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:18,940 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:19:18,940 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:19:18,944 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 8#L29true assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 11#L33true assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); 14#L36true call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1);< 7#multENTRYtrue [2022-02-21 04:19:18,945 INFO L793 eck$LassoCheckResult]: Loop: 7#multENTRYtrue ~n := #in~n;~m := #in~m; 4#L18true assume ~m < 0; 20#L19true call #t~ret4 := mult(~n, -~m);< 7#multENTRYtrue [2022-02-21 04:19:18,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:18,949 INFO L85 PathProgramCache]: Analyzing trace with hash 42056133, now seen corresponding path program 1 times [2022-02-21 04:19:18,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:18,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585366381] [2022-02-21 04:19:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:18,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:19,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:19,080 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:19,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:19,083 INFO L85 PathProgramCache]: Analyzing trace with hash 29925, now seen corresponding path program 1 times [2022-02-21 04:19:19,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:19,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077662724] [2022-02-21 04:19:19,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:19,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:19,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:19,104 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:19,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1236192095, now seen corresponding path program 1 times [2022-02-21 04:19:19,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:19,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793216886] [2022-02-21 04:19:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:19,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-02-21 04:19:19,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {30#true} is VALID [2022-02-21 04:19:19,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {30#true} is VALID [2022-02-21 04:19:19,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); {32#(<= 0 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-21 04:19:19,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#(<= 0 |ULTIMATE.start_main_~n~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {33#(<= 0 |mult_#in~m|)} is VALID [2022-02-21 04:19:19,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {34#(<= 0 mult_~m)} is VALID [2022-02-21 04:19:19,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#(<= 0 mult_~m)} assume ~m < 0; {31#false} is VALID [2022-02-21 04:19:19,229 INFO L272 TraceCheckUtils]: 7: Hoare triple {31#false} call #t~ret4 := mult(~n, -~m); {31#false} is VALID [2022-02-21 04:19:19,230 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 04:19:19,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:19,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793216886] [2022-02-21 04:19:19,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793216886] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:19,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:19,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:19,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885177386] [2022-02-21 04:19:19,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:19,357 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:19,358 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:19,358 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:19,358 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:19,359 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:19,359 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,359 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:19,359 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:19,360 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration1_Loop [2022-02-21 04:19:19,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:19,360 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:19,369 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 04:19:19,373 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 04:19:19,376 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 04:19:19,378 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 04:19:19,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:19:19,382 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 04:19:19,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 04:19:19,453 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:19,454 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:19,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,457 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 04:19:19,458 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 04:19:19,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:19,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:19,486 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:19,486 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:19,503 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 04:19:19,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,505 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 04:19:19,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:19,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:19,529 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 04:19:19,531 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:19,531 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret4=0} Honda state: {mult_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:19,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:19,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,548 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 04:19:19,553 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 04:19:19,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:19,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:19,562 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:19,562 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:19,578 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 04:19:19,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,580 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 04:19:19,588 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 04:19:19,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:19,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:19,597 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:19,597 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:19,615 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 04:19:19,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,617 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 04:19:19,617 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 04:19:19,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:19,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:19,626 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:19,627 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:19,643 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 04:19:19,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,645 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 04:19:19,645 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 04:19:19,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:19,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:19,654 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:19,654 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:19,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:19,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,671 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 04:19:19,680 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 04:19:19,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:19,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:19,712 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 04:19:19,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,714 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 04:19:19,714 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 04:19:19,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:19,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:19,763 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:19,767 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 04:19:19,768 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:19,768 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:19,768 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:19,768 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:19,768 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:19,768 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,768 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:19,768 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:19,768 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration1_Loop [2022-02-21 04:19:19,768 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:19,768 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:19,769 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 04:19:19,774 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 04:19:19,778 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 04:19:19,781 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 04:19:19,783 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 04:19:19,785 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 04:19:19,787 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 04:19:19,854 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:19,857 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,860 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 04:19:19,861 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 04:19:19,862 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 04:19:19,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:19,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:19,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:19,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:19,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:19,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:19,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:19,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:19,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:19,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,913 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 04:19:19,919 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 04:19:19,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:19,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:19,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:19,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:19,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:19,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:19,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:19,929 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 04:19:19,938 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:19,964 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 04:19:19,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:19,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:19,966 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 04:19:19,966 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 04:19:19,973 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 04:19:19,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:19,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:19,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:19,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:19,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:19,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:19,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:19,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:20,016 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 04:19:20,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:20,019 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 04:19:20,020 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 04:19:20,024 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 04:19:20,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:20,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:20,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:20,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:20,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:20,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:20,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:20,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:20,068 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 04:19:20,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:20,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:20,070 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 04:19:20,070 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 04:19:20,072 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 04:19:20,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:20,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:20,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:20,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:20,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:20,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:20,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:20,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:20,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:20,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:20,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:20,104 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 04:19:20,104 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 04:19:20,105 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 04:19:20,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:20,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:20,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:20,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:20,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:20,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:20,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:20,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:20,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:20,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:20,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:20,142 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 04:19:20,143 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 04:19:20,144 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 04:19:20,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:20,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:20,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:20,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:20,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:20,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:20,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:20,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:20,170 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:20,170 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:20,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:20,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:20,172 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 04:19:20,173 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 04:19:20,174 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:20,174 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:20,174 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:20,174 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2022-02-21 04:19:20,191 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 04:19:20,205 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:20,217 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret4 := mult(~n, -~m);"< [2022-02-21 04:19:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:20,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:20,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:19:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:20,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:20,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {35#unseeded} is VALID [2022-02-21 04:19:20,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {35#unseeded} is VALID [2022-02-21 04:19:20,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {35#unseeded} is VALID [2022-02-21 04:19:20,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); {35#unseeded} is VALID [2022-02-21 04:19:20,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#unseeded} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {35#unseeded} is VALID [2022-02-21 04:19:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:20,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:19:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:20,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:20,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#(>= oldRank0 (* (- 1) |mult_#in~m|))} ~n := #in~n;~m := #in~m; {65#(<= 0 (+ oldRank0 mult_~m))} is VALID [2022-02-21 04:19:20,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#(<= 0 (+ oldRank0 mult_~m))} assume ~m < 0; {69#(and (<= 0 (+ oldRank0 mult_~m)) (< mult_~m 0))} is VALID [2022-02-21 04:19:20,365 INFO L272 TraceCheckUtils]: 2: Hoare triple {69#(and (<= 0 (+ oldRank0 mult_~m)) (< mult_~m 0))} call #t~ret4 := mult(~n, -~m); {48#(or unseeded (and (>= oldRank0 0) (> oldRank0 (* (- 1) |mult_#in~m|))))} is VALID [2022-02-21 04:19:20,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:20,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:20,422 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 04:19:20,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 04:19:20,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,430 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 04:19:20,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:20,447 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 04:19:20,573 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4). Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 66 transitions. Complement of second has 12 states. [2022-02-21 04:19:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:20,574 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:20,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:20,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:19:20,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:20,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:20,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:20,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:20,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:20,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:20,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 66 transitions. [2022-02-21 04:19:20,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:19:20,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:20,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:20,582 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:20,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:19:20,585 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:19:20,585 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:20,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:20,586 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:20,586 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 66 transitions. cyclomatic complexity: 17 [2022-02-21 04:19:20,587 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:19:20,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 5 letters. Loop has 3 letters. [2022-02-21 04:19:20,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 04:19:20,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2022-02-21 04:19:20,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:20,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:20,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:20,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:20,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:20,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:20,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 51 letters. Loop has 51 letters. [2022-02-21 04:19:20,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 51 letters. [2022-02-21 04:19:20,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 51 letters. Loop has 51 letters. [2022-02-21 04:19:20,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:19:20,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:19:20,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 22 letters. Loop has 22 letters. [2022-02-21 04:19:20,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:19:20,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 04:19:20,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2022-02-21 04:19:20,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:19:20,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:19:20,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:19:20,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:19:20,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:19:20,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2022-02-21 04:19:20,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:19:20,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:19:20,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:19:20,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:19:20,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:19:20,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2022-02-21 04:19:20,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 5 letters. Loop has 3 letters. [2022-02-21 04:19:20,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 04:19:20,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 3 letters. [2022-02-21 04:19:20,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:20,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:20,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:20,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:20,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:20,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:20,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:20,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:20,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:20,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:20,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:20,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:20,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:20,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:20,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:20,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:19:20,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:19:20,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 66 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:19:20,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,606 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 04:19:20,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 04:19:20,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 04:19:20,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2022-02-21 04:19:20,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:20,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 66 transitions. cyclomatic complexity: 17 [2022-02-21 04:19:20,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:19:20,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 32 states and 45 transitions. [2022-02-21 04:19:20,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 04:19:20,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-02-21 04:19:20,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2022-02-21 04:19:20,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:20,625 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2022-02-21 04:19:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2022-02-21 04:19:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-21 04:19:20,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:20,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 45 transitions. Second operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 04:19:20,644 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 45 transitions. Second operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 04:19:20,646 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 04:19:20,648 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:20,653 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-02-21 04:19:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-02-21 04:19:20,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:20,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:20,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Second operand 32 states and 45 transitions. [2022-02-21 04:19:20,655 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Second operand 32 states and 45 transitions. [2022-02-21 04:19:20,655 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:20,664 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2022-02-21 04:19:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2022-02-21 04:19:20,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:20,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:20,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:20,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 04:19:20,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-21 04:19:20,671 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-21 04:19:20,671 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:20,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:19:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:19:20,673 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:20,787 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-02-21 04:19:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:19:20,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:20,793 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 04:19:20,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2022-02-21 04:19:20,797 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:19:20,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 34 transitions. [2022-02-21 04:19:20,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-02-21 04:19:20,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-02-21 04:19:20,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2022-02-21 04:19:20,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:20,799 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-02-21 04:19:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2022-02-21 04:19:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-02-21 04:19:20,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:20,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 34 transitions. Second operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:20,801 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 34 transitions. Second operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:20,801 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:20,803 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-21 04:19:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-21 04:19:20,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:20,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:20,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states and 34 transitions. [2022-02-21 04:19:20,803 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states and 34 transitions. [2022-02-21 04:19:20,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:20,811 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-21 04:19:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-21 04:19:20,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:20,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:20,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:20,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-21 04:19:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-02-21 04:19:20,813 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-21 04:19:20,813 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-02-21 04:19:20,813 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:19:20,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2022-02-21 04:19:20,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 04:19:20,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:20,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:20,814 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:20,814 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:19:20,815 INFO L791 eck$LassoCheckResult]: Stem: 507#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); 508#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 512#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 513#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); 505#L36 call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1);< 511#multENTRY ~n := #in~n;~m := #in~m; 504#L18 assume !(~m < 0); 506#L21 assume !(0 == ~m); 515#L24 call #t~ret5 := mult(~n, ~m - 1);< 521#multENTRY [2022-02-21 04:19:20,815 INFO L793 eck$LassoCheckResult]: Loop: 521#multENTRY ~n := #in~n;~m := #in~m; 523#L18 assume ~m < 0; 518#L19 call #t~ret4 := mult(~n, -~m);< 521#multENTRY [2022-02-21 04:19:20,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash 332752684, now seen corresponding path program 1 times [2022-02-21 04:19:20,815 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:20,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979842126] [2022-02-21 04:19:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:20,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:20,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:20,833 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash 29925, now seen corresponding path program 2 times [2022-02-21 04:19:20,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:20,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717218766] [2022-02-21 04:19:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:20,836 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:20,839 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash 250690010, now seen corresponding path program 1 times [2022-02-21 04:19:20,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:20,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857176256] [2022-02-21 04:19:20,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:20,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:20,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {588#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {588#true} is VALID [2022-02-21 04:19:20,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {588#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {588#true} is VALID [2022-02-21 04:19:20,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {588#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {588#true} is VALID [2022-02-21 04:19:20,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {588#true} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); {588#true} is VALID [2022-02-21 04:19:20,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {588#true} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {588#true} is VALID [2022-02-21 04:19:20,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {588#true} ~n := #in~n;~m := #in~m; {588#true} is VALID [2022-02-21 04:19:20,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {588#true} assume !(~m < 0); {590#(< 0 (+ mult_~m 1))} is VALID [2022-02-21 04:19:20,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {590#(< 0 (+ mult_~m 1))} assume !(0 == ~m); {591#(not (<= mult_~m 0))} is VALID [2022-02-21 04:19:20,908 INFO L272 TraceCheckUtils]: 8: Hoare triple {591#(not (<= mult_~m 0))} call #t~ret5 := mult(~n, ~m - 1); {592#(<= 0 |mult_#in~m|)} is VALID [2022-02-21 04:19:20,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {590#(< 0 (+ mult_~m 1))} is VALID [2022-02-21 04:19:20,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {590#(< 0 (+ mult_~m 1))} assume ~m < 0; {589#false} is VALID [2022-02-21 04:19:20,909 INFO L272 TraceCheckUtils]: 11: Hoare triple {589#false} call #t~ret4 := mult(~n, -~m); {589#false} is VALID [2022-02-21 04:19:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:20,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:20,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857176256] [2022-02-21 04:19:20,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857176256] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:20,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:20,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:20,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806979649] [2022-02-21 04:19:20,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:20,980 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:20,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:20,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:20,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:20,980 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:20,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:20,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:20,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:20,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration2_Loop [2022-02-21 04:19:20,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:20,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:20,981 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 04:19:20,983 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 04:19:20,984 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 04:19:20,986 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 04:19:20,990 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 04:19:20,992 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 04:19:20,993 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 04:19:21,057 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:21,058 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:21,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,059 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 04:19:21,059 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 04:19:21,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:21,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:21,068 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:21,068 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:21,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 04:19:21,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,085 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:19:21,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:19:21,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:21,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:21,095 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:21,095 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:21,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:21,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,118 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:19:21,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:21,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:21,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:19:21,129 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:21,129 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:21,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:21,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,148 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:19:21,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:19:21,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:21,150 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:21,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:21,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,174 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:19:21,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:19:21,176 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:21,176 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:21,231 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:21,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:19:21,234 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:21,234 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:21,234 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:21,234 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:21,234 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:21,234 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,234 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:21,235 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:21,235 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration2_Loop [2022-02-21 04:19:21,235 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:21,235 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:21,235 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 04:19:21,237 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 04:19:21,243 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 04:19:21,247 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 04:19:21,249 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 04:19:21,252 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 04:19:21,254 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 04:19:21,313 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:21,313 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:21,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,314 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:19:21,319 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 04:19:21,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:21,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:21,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:21,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:21,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:21,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:21,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:21,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:19:21,338 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:21,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:21,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,355 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:19:21,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:19:21,357 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 04:19:21,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:21,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:21,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:21,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:21,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:21,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:21,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:21,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:21,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 04:19:21,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,380 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:19:21,386 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 04:19:21,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:19:21,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:21,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:21,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:21,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:21,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:21,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:21,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:21,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:21,397 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:21,397 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:21,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:21,398 INFO L229 MonitoredProcess]: Starting monitored process 26 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 04:19:21,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:19:21,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:21,400 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:21,400 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:21,400 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2022-02-21 04:19:21,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:21,424 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:21,427 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret4 := mult(~n, -~m);"< [2022-02-21 04:19:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:19:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:21,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {593#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {593#unseeded} is VALID [2022-02-21 04:19:21,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {593#unseeded} is VALID [2022-02-21 04:19:21,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {593#unseeded} is VALID [2022-02-21 04:19:21,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {593#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); {593#unseeded} is VALID [2022-02-21 04:19:21,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {593#unseeded} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {593#unseeded} is VALID [2022-02-21 04:19:21,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#unseeded} ~n := #in~n;~m := #in~m; {593#unseeded} is VALID [2022-02-21 04:19:21,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {593#unseeded} assume !(~m < 0); {593#unseeded} is VALID [2022-02-21 04:19:21,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {593#unseeded} assume !(0 == ~m); {593#unseeded} is VALID [2022-02-21 04:19:21,523 INFO L272 TraceCheckUtils]: 8: Hoare triple {593#unseeded} call #t~ret5 := mult(~n, ~m - 1); {593#unseeded} is VALID [2022-02-21 04:19:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:19:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:21,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:21,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#(>= oldRank0 (* (- 1) |mult_#in~m|))} ~n := #in~n;~m := #in~m; {635#(<= 0 (+ oldRank0 mult_~m))} is VALID [2022-02-21 04:19:21,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {635#(<= 0 (+ oldRank0 mult_~m))} assume ~m < 0; {639#(and (<= 0 (+ oldRank0 mult_~m)) (< mult_~m 0))} is VALID [2022-02-21 04:19:21,577 INFO L272 TraceCheckUtils]: 2: Hoare triple {639#(and (<= 0 (+ oldRank0 mult_~m)) (< mult_~m 0))} call #t~ret4 := mult(~n, -~m); {606#(or unseeded (and (>= oldRank0 0) (> oldRank0 (* (- 1) |mult_#in~m|))))} is VALID [2022-02-21 04:19:21,577 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 04:19:21,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:21,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:21,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:21,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,585 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 04:19:21,585 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 6 Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:21,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:21,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 6. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 92 transitions. Complement of second has 15 states. [2022-02-21 04:19:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:21,741 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:21,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. cyclomatic complexity: 6 [2022-02-21 04:19:21,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:21,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:21,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:21,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:21,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:21,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:21,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 92 transitions. [2022-02-21 04:19:21,759 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 04:19:21,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:21,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:21,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 28 transitions. cyclomatic complexity: 6 [2022-02-21 04:19:21,761 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 04:19:21,761 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:21,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:21,764 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:21,764 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 73 states and 92 transitions. cyclomatic complexity: 22 [2022-02-21 04:19:21,767 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 04:19:21,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:21,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:21,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:21,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:21,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:21,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:21,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:21,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:21,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:21,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:19:21,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:19:21,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 73 letters. Loop has 73 letters. [2022-02-21 04:19:21,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 23 letters. Loop has 23 letters. [2022-02-21 04:19:21,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 23 letters. [2022-02-21 04:19:21,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 23 letters. Loop has 23 letters. [2022-02-21 04:19:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 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 04:19:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 04:19:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:21,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:21,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:21,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:21,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:21,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:21,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:21,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:21,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 04:19:21,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:19:21,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:19:21,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 4 letters. [2022-02-21 04:19:21,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:21,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:21,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:21,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:21,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:21,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:21,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:21,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:21,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:21,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:21,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 28 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:21,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:21,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 73 states and 92 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:21,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,775 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:21,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-21 04:19:21,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 04:19:21,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:21,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 04:19:21,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:21,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. cyclomatic complexity: 22 [2022-02-21 04:19:21,789 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 04:19:21,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 51 states and 66 transitions. [2022-02-21 04:19:21,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-02-21 04:19:21,792 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 04:19:21,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2022-02-21 04:19:21,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:21,792 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 66 transitions. [2022-02-21 04:19:21,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2022-02-21 04:19:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-02-21 04:19:21,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:21,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states and 66 transitions. Second operand has 44 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-21 04:19:21,794 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states and 66 transitions. Second operand has 44 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-21 04:19:21,795 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 44 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-21 04:19:21,795 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:21,799 INFO L93 Difference]: Finished difference Result 94 states and 117 transitions. [2022-02-21 04:19:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2022-02-21 04:19:21,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:21,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:21,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Second operand 51 states and 66 transitions. [2022-02-21 04:19:21,801 INFO L87 Difference]: Start difference. First operand has 44 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Second operand 51 states and 66 transitions. [2022-02-21 04:19:21,801 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:21,806 INFO L93 Difference]: Finished difference Result 124 states and 156 transitions. [2022-02-21 04:19:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 156 transitions. [2022-02-21 04:19:21,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:21,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:21,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:21,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:21,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-21 04:19:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2022-02-21 04:19:21,809 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 55 transitions. [2022-02-21 04:19:21,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:19:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:19:21,809 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,901 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-02-21 04:19:21,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:19:21,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:21,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:21,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2022-02-21 04:19:21,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-02-21 04:19:21,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 48 transitions. [2022-02-21 04:19:21,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-02-21 04:19:21,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-02-21 04:19:21,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 48 transitions. [2022-02-21 04:19:21,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:21,913 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-02-21 04:19:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 48 transitions. [2022-02-21 04:19:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-21 04:19:21,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:21,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 48 transitions. Second operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:19:21,915 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 48 transitions. Second operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:19:21,915 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:19:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,916 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-02-21 04:19:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-02-21 04:19:21,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:21,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:21,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Second operand 42 states and 48 transitions. [2022-02-21 04:19:21,917 INFO L87 Difference]: Start difference. First operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Second operand 42 states and 48 transitions. [2022-02-21 04:19:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:21,918 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-02-21 04:19:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-02-21 04:19:21,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:21,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:21,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:21,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 04:19:21,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-02-21 04:19:21,919 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-02-21 04:19:21,919 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-02-21 04:19:21,919 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:19:21,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2022-02-21 04:19:21,920 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-02-21 04:19:21,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:21,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:21,920 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:21,920 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 04:19:21,920 INFO L791 eck$LassoCheckResult]: Stem: 1299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); 1300#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 1310#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 1311#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); 1302#L36 call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1);< 1312#multENTRY ~n := #in~n;~m := #in~m; 1327#L18 assume !(~m < 0); 1325#L21 assume 0 == ~m;#res := 0; 1324#multFINAL assume true; 1301#multEXIT >#46#return; 1303#L36-1 main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; 1306#L37 call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1);< 1304#multENTRY [2022-02-21 04:19:21,920 INFO L793 eck$LassoCheckResult]: Loop: 1304#multENTRY ~n := #in~n;~m := #in~m; 1307#L18 assume ~m < 0; 1305#L19 call #t~ret4 := mult(~n, -~m);< 1304#multENTRY [2022-02-21 04:19:21,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash 248917746, now seen corresponding path program 1 times [2022-02-21 04:19:21,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:21,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539250335] [2022-02-21 04:19:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,955 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash 29925, now seen corresponding path program 3 times [2022-02-21 04:19:21,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:21,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616029823] [2022-02-21 04:19:21,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:21,971 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:21,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1899948972, now seen corresponding path program 1 times [2022-02-21 04:19:21,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:21,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930083684] [2022-02-21 04:19:21,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:21,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:22,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-21 04:19:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:22,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {1428#true} ~n := #in~n;~m := #in~m; {1428#true} is VALID [2022-02-21 04:19:22,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {1428#true} assume !(~m < 0); {1428#true} is VALID [2022-02-21 04:19:22,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {1428#true} assume 0 == ~m;#res := 0; {1428#true} is VALID [2022-02-21 04:19:22,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-02-21 04:19:22,013 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1428#true} {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} #46#return; {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 04:19:22,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {1428#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {1428#true} is VALID [2022-02-21 04:19:22,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {1428#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1428#true} is VALID [2022-02-21 04:19:22,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {1428#true} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 04:19:22,014 INFO L290 TraceCheckUtils]: 3: Hoare triple {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 04:19:22,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {1428#true} is VALID [2022-02-21 04:19:22,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {1428#true} ~n := #in~n;~m := #in~m; {1428#true} is VALID [2022-02-21 04:19:22,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {1428#true} assume !(~m < 0); {1428#true} is VALID [2022-02-21 04:19:22,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {1428#true} assume 0 == ~m;#res := 0; {1428#true} is VALID [2022-02-21 04:19:22,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-02-21 04:19:22,015 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1428#true} {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} #46#return; {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 04:19:22,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} is VALID [2022-02-21 04:19:22,016 INFO L272 TraceCheckUtils]: 11: Hoare triple {1430#(<= 0 |ULTIMATE.start_main_~m~0#1|)} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {1436#(<= 0 |mult_#in~m|)} is VALID [2022-02-21 04:19:22,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {1436#(<= 0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {1437#(<= 0 mult_~m)} is VALID [2022-02-21 04:19:22,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {1437#(<= 0 mult_~m)} assume ~m < 0; {1429#false} is VALID [2022-02-21 04:19:22,016 INFO L272 TraceCheckUtils]: 14: Hoare triple {1429#false} call #t~ret4 := mult(~n, -~m); {1429#false} is VALID [2022-02-21 04:19:22,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:19:22,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:19:22,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930083684] [2022-02-21 04:19:22,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930083684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:19:22,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:19:22,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:19:22,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001059546] [2022-02-21 04:19:22,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:19:22,080 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:22,080 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:22,081 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:22,081 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:22,081 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:22,081 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,081 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:22,081 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:22,081 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration3_Loop [2022-02-21 04:19:22,081 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:22,081 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:22,082 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 04:19:22,083 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 04:19:22,085 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 04:19:22,087 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 04:19:22,088 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 04:19:22,090 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 04:19:22,092 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 04:19:22,152 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:22,152 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:22,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,153 INFO L229 MonitoredProcess]: Starting monitored process 27 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 04:19:22,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:19:22,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:22,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:22,176 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:22,176 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:22,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:22,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,192 INFO L229 MonitoredProcess]: Starting monitored process 28 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 04:19:22,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 04:19:22,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:22,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:22,201 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:22,202 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:22,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:22,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,218 INFO L229 MonitoredProcess]: Starting monitored process 29 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 04:19:22,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 04:19:22,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:22,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:22,225 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:22,226 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret4=0} Honda state: {mult_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:22,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:22,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,242 INFO L229 MonitoredProcess]: Starting monitored process 30 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 04:19:22,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 04:19:22,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:22,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:22,250 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:22,250 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:22,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 04:19:22,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,266 INFO L229 MonitoredProcess]: Starting monitored process 31 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 04:19:22,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 04:19:22,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:22,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:22,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:22,274 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:22,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 04:19:22,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,289 INFO L229 MonitoredProcess]: Starting monitored process 32 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 04:19:22,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 04:19:22,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:22,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:22,297 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:22,297 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:22,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 04:19:22,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,314 INFO L229 MonitoredProcess]: Starting monitored process 33 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 04:19:22,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 04:19:22,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:22,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:22,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-02-21 04:19:22,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,337 INFO L229 MonitoredProcess]: Starting monitored process 34 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 04:19:22,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 04:19:22,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:22,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:22,369 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:22,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 04:19:22,372 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:22,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:22,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:22,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:22,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:22,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:22,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:22,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration3_Loop [2022-02-21 04:19:22,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:22,372 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:22,373 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 04:19:22,376 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 04:19:22,377 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 04:19:22,379 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 04:19:22,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 04:19:22,382 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 04:19:22,384 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 04:19:22,433 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:22,433 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:22,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,434 INFO L229 MonitoredProcess]: Starting monitored process 35 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 04:19:22,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 04:19:22,437 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 04:19:22,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:22,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:22,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:22,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:22,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:22,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:22,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:22,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:22,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 04:19:22,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,461 INFO L229 MonitoredProcess]: Starting monitored process 36 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 04:19:22,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 04:19:22,464 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 04:19:22,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:22,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:22,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:22,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:22,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:22,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:22,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:22,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:22,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:22,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,493 INFO L229 MonitoredProcess]: Starting monitored process 37 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 04:19:22,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 04:19:22,495 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 04:19:22,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:22,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:22,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:22,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:22,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:22,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:22,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:22,502 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:22,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:22,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,518 INFO L229 MonitoredProcess]: Starting monitored process 38 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 04:19:22,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 04:19:22,520 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 04:19:22,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:22,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:22,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:22,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:22,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:22,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:22,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:22,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:22,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 04:19:22,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,551 INFO L229 MonitoredProcess]: Starting monitored process 39 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 04:19:22,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 04:19:22,552 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 04:19:22,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:22,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:22,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:22,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:22,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:22,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:22,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:22,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:22,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:22,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,577 INFO L229 MonitoredProcess]: Starting monitored process 40 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 04:19:22,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 04:19:22,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 04:19:22,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:22,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:22,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:22,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:22,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:22,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:22,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:22,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:22,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 04:19:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,602 INFO L229 MonitoredProcess]: Starting monitored process 41 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 04:19:22,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 04:19:22,605 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 04:19:22,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:22,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:22,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:22,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:22,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:22,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:22,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:22,626 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:22,627 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:22,627 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:22,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:22,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:22,629 INFO L229 MonitoredProcess]: Starting monitored process 42 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 04:19:22,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 04:19:22,631 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:22,631 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:22,631 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:22,631 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = -1*mult_#in~m Supporting invariants [] [2022-02-21 04:19:22,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:22,655 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:22,657 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume ~m < 0;" "call #t~ret4 := mult(~n, -~m);"< [2022-02-21 04:19:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:22,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:22,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:19:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:22,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:22,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {1438#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {1438#unseeded} is VALID [2022-02-21 04:19:22,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {1438#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1438#unseeded} is VALID [2022-02-21 04:19:22,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {1438#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1438#unseeded} is VALID [2022-02-21 04:19:22,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {1438#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); {1438#unseeded} is VALID [2022-02-21 04:19:22,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {1438#unseeded} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:22,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n;~m := #in~m; {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:22,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~m < 0); {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:22,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~m;#res := 0; {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:22,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:22,768 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1468#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1438#unseeded} #46#return; {1438#unseeded} is VALID [2022-02-21 04:19:22,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {1438#unseeded} main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {1438#unseeded} is VALID [2022-02-21 04:19:22,769 INFO L272 TraceCheckUtils]: 11: Hoare triple {1438#unseeded} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {1438#unseeded} is VALID [2022-02-21 04:19:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:22,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 04:19:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:22,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:22,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {1441#(>= oldRank0 (* (- 1) |mult_#in~m|))} ~n := #in~n;~m := #in~m; {1490#(<= 0 (+ oldRank0 mult_~m))} is VALID [2022-02-21 04:19:22,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {1490#(<= 0 (+ oldRank0 mult_~m))} assume ~m < 0; {1494#(and (<= 0 (+ oldRank0 mult_~m)) (< mult_~m 0))} is VALID [2022-02-21 04:19:22,813 INFO L272 TraceCheckUtils]: 2: Hoare triple {1494#(and (<= 0 (+ oldRank0 mult_~m)) (< mult_~m 0))} call #t~ret4 := mult(~n, -~m); {1451#(or unseeded (and (>= oldRank0 0) (> oldRank0 (* (- 1) |mult_#in~m|))))} is VALID [2022-02-21 04:19:22,813 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 04:19:22,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:22,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:22,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:22,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,824 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 04:19:22,824 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 48 transitions. cyclomatic complexity: 9 Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:22,919 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 48 transitions. cyclomatic complexity: 9. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 82 states and 91 transitions. Complement of second has 14 states. [2022-02-21 04:19:22,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:22,919 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:22,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. cyclomatic complexity: 9 [2022-02-21 04:19:22,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:22,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:22,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:22,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:22,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:22,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:22,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 91 transitions. [2022-02-21 04:19:22,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 04:19:22,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:22,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:22,921 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 48 transitions. cyclomatic complexity: 9 [2022-02-21 04:19:22,922 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 04:19:22,922 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:22,923 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 04:19:22,923 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:22,923 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 82 states and 91 transitions. cyclomatic complexity: 13 [2022-02-21 04:19:22,924 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 04:19:22,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:22,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:22,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:22,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:22,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:22,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:22,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 82 letters. Loop has 82 letters. [2022-02-21 04:19:22,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 82 letters. Loop has 82 letters. [2022-02-21 04:19:22,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 82 letters. Loop has 82 letters. [2022-02-21 04:19:22,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:19:22,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:19:22,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:19:22,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:22,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:22,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:22,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:22,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:22,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:22,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:22,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:22,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:22,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:22,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:22,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:22,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:22,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:22,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:22,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:22,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:22,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 3 letters. [2022-02-21 04:19:22,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:22,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:22,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 3 letters. [2022-02-21 04:19:22,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:22,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:22,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 3 letters. [2022-02-21 04:19:22,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:22,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:22,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 3 letters. [2022-02-21 04:19:22,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:19:22,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:19:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 3 letters. [2022-02-21 04:19:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 04:19:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:22,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:22,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:22,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:22,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:22,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:22,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:22,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:22,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:22,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:22,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 4 letters. [2022-02-21 04:19:22,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 22 letters. Loop has 4 letters. [2022-02-21 04:19:22,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 4 letters. [2022-02-21 04:19:22,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 4 letters. [2022-02-21 04:19:22,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 19 letters. Loop has 4 letters. [2022-02-21 04:19:22,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 4 letters. [2022-02-21 04:19:22,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 4 letters. [2022-02-21 04:19:22,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 20 letters. Loop has 4 letters. [2022-02-21 04:19:22,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 20 letters. Loop has 4 letters. [2022-02-21 04:19:22,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 48 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 4 letters. [2022-02-21 04:19:22,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 21 letters. Loop has 4 letters. [2022-02-21 04:19:22,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 91 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 4 letters. [2022-02-21 04:19:22,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,944 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:22,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 04:19:22,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 04:19:22,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2022-02-21 04:19:22,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 12 letters. Loop has 6 letters. [2022-02-21 04:19:22,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:22,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 91 transitions. cyclomatic complexity: 13 [2022-02-21 04:19:22,975 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 04:19:22,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 63 states and 71 transitions. [2022-02-21 04:19:22,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2022-02-21 04:19:22,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-02-21 04:19:22,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 71 transitions. [2022-02-21 04:19:22,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:19:22,977 INFO L681 BuchiCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-02-21 04:19:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 71 transitions. [2022-02-21 04:19:22,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 36. [2022-02-21 04:19:22,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:22,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states and 71 transitions. Second operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:19:22,979 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states and 71 transitions. Second operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:19:22,980 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:19:22,980 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:22,982 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-02-21 04:19:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-02-21 04:19:22,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:22,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:22,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 63 states and 71 transitions. [2022-02-21 04:19:22,983 INFO L87 Difference]: Start difference. First operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 63 states and 71 transitions. [2022-02-21 04:19:22,983 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:19:22,986 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-02-21 04:19:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-02-21 04:19:22,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:22,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:22,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:22,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:19:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-21 04:19:22,988 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-21 04:19:22,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:19:22,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:19:22,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:19:22,989 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:23,044 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-21 04:19:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:19:23,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:23,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:23,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2022-02-21 04:19:23,057 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 04:19:23,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 40 transitions. [2022-02-21 04:19:23,058 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-02-21 04:19:23,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-02-21 04:19:23,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2022-02-21 04:19:23,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:23,058 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-02-21 04:19:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2022-02-21 04:19:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2022-02-21 04:19:23,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:23,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 40 transitions. Second operand has 32 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:19:23,059 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 40 transitions. Second operand has 32 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:19:23,060 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 32 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:19:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:23,060 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-21 04:19:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-21 04:19:23,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:23,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:23,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 36 states and 40 transitions. [2022-02-21 04:19:23,061 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Second operand 36 states and 40 transitions. [2022-02-21 04:19:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:23,063 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-21 04:19:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-21 04:19:23,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:23,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:23,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:23,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 04:19:23,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-02-21 04:19:23,064 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-21 04:19:23,065 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-02-21 04:19:23,065 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:19:23,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2022-02-21 04:19:23,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 04:19:23,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:23,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:23,066 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:19:23,066 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:19:23,066 INFO L791 eck$LassoCheckResult]: Stem: 2016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); 2017#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 2025#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2026#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); 2027#L36 call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1);< 2028#multENTRY ~n := #in~n;~m := #in~m; 2034#L18 assume !(~m < 0); 2033#L21 assume 0 == ~m;#res := 0; 2032#multFINAL assume true; 2031#multEXIT >#46#return; 2029#L36-1 main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; 2015#L37 call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1);< 2021#multENTRY [2022-02-21 04:19:23,066 INFO L793 eck$LassoCheckResult]: Loop: 2021#multENTRY ~n := #in~n;~m := #in~m; 2012#L18 assume !(~m < 0); 2014#L21 assume !(0 == ~m); 2013#L24 call #t~ret5 := mult(~n, ~m - 1);< 2021#multENTRY [2022-02-21 04:19:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash 248917746, now seen corresponding path program 2 times [2022-02-21 04:19:23,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:23,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139929582] [2022-02-21 04:19:23,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:23,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:23,074 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:23,079 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 929640, now seen corresponding path program 1 times [2022-02-21 04:19:23,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:23,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900716928] [2022-02-21 04:19:23,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:23,099 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:23,102 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1231125977, now seen corresponding path program 1 times [2022-02-21 04:19:23,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:23,102 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048791414] [2022-02-21 04:19:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:23,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:23,131 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:23,213 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:23,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:23,214 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:23,214 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:23,214 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:23,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:23,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:23,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration4_Loop [2022-02-21 04:19:23,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:23,214 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:23,215 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 04:19:23,218 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 04:19:23,219 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 04:19:23,221 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 04:19:23,222 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 04:19:23,226 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 04:19:23,228 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 04:19:23,280 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:23,280 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:23,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,281 INFO L229 MonitoredProcess]: Starting monitored process 43 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 04:19:23,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 04:19:23,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:23,323 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:23,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:23,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,340 INFO L229 MonitoredProcess]: Starting monitored process 44 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 04:19:23,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 04:19:23,360 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:23,360 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:23,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:23,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,377 INFO L229 MonitoredProcess]: Starting monitored process 45 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 04:19:23,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 04:19:23,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,385 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:23,385 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#t~ret5=0} Honda state: {mult_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:23,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:23,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,401 INFO L229 MonitoredProcess]: Starting monitored process 46 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 04:19:23,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 04:19:23,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,409 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:23,409 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:23,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 04:19:23,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,425 INFO L229 MonitoredProcess]: Starting monitored process 47 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 04:19:23,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 04:19:23,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:23,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-02-21 04:19:23,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,456 INFO L229 MonitoredProcess]: Starting monitored process 48 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 04:19:23,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 04:19:23,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:23,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:23,508 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:23,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 04:19:23,511 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:23,511 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:23,511 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:23,511 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:23,511 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:23,511 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,511 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:23,511 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:23,511 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration4_Loop [2022-02-21 04:19:23,511 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:23,511 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:23,512 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 04:19:23,514 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 04:19:23,515 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 04:19:23,520 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 04:19:23,521 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 04:19:23,524 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 04:19:23,525 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 04:19:23,593 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:23,594 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:23,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,595 INFO L229 MonitoredProcess]: Starting monitored process 49 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 04:19:23,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 04:19:23,597 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 04:19:23,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:23,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:23,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:23,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:23,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:23,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:23,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:23,604 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:23,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 04:19:23,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,620 INFO L229 MonitoredProcess]: Starting monitored process 50 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 04:19:23,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 04:19:23,622 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 04:19:23,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:23,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:23,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:23,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:23,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:23,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:23,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:23,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:23,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-02-21 04:19:23,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,643 INFO L229 MonitoredProcess]: Starting monitored process 51 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 04:19:23,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 04:19:23,646 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 04:19:23,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:23,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:23,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:23,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:23,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:23,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:23,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:23,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:23,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-02-21 04:19:23,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,667 INFO L229 MonitoredProcess]: Starting monitored process 52 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 04:19:23,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 04:19:23,669 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 04:19:23,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:23,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:23,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:23,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:23,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:23,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:23,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:23,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:23,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:23,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,699 INFO L229 MonitoredProcess]: Starting monitored process 53 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 04:19:23,703 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 04:19:23,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:23,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:23,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:23,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:23,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:23,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:23,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:23,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 04:19:23,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:23,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:23,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,735 INFO L229 MonitoredProcess]: Starting monitored process 54 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 04:19:23,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 04:19:23,737 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 04:19:23,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:23,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:23,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:23,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:23,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:23,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:23,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:23,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:23,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:23,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,775 INFO L229 MonitoredProcess]: Starting monitored process 55 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 04:19:23,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 04:19:23,777 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 04:19:23,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:23,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:23,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:23,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:23,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:23,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:23,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:23,784 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:23,787 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:23,787 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:23,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:23,788 INFO L229 MonitoredProcess]: Starting monitored process 56 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 04:19:23,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 04:19:23,790 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:23,790 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:23,790 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:23,790 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = 1*mult_#in~m Supporting invariants [] [2022-02-21 04:19:23,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-02-21 04:19:23,809 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:23,811 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(0 == ~m);" "call #t~ret5 := mult(~n, ~m - 1);"< [2022-02-21 04:19:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:23,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:23,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 04:19:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:23,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:23,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {2125#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2125#unseeded} is VALID [2022-02-21 04:19:23,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {2125#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2125#unseeded} is VALID [2022-02-21 04:19:23,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {2125#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2125#unseeded} is VALID [2022-02-21 04:19:23,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {2125#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); {2125#unseeded} is VALID [2022-02-21 04:19:23,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {2125#unseeded} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:23,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~n := #in~n;~m := #in~m; {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:23,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~m < 0); {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:23,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~m;#res := 0; {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:23,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 04:19:23,934 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2155#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2125#unseeded} #46#return; {2125#unseeded} is VALID [2022-02-21 04:19:23,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {2125#unseeded} main_~res1~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1; {2125#unseeded} is VALID [2022-02-21 04:19:23,935 INFO L272 TraceCheckUtils]: 11: Hoare triple {2125#unseeded} call main_#t~ret9#1 := mult(main_~n~0#1, main_~m~0#1); {2125#unseeded} is VALID [2022-02-21 04:19:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:23,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:23,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:23,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {2128#(>= oldRank0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {2177#(<= mult_~m oldRank0)} is VALID [2022-02-21 04:19:23,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {2177#(<= mult_~m oldRank0)} assume !(~m < 0); {2181#(and (<= mult_~m oldRank0) (not (< mult_~m 0)))} is VALID [2022-02-21 04:19:23,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {2181#(and (<= mult_~m oldRank0) (not (< mult_~m 0)))} assume !(0 == ~m); {2185#(and (<= mult_~m oldRank0) (not (< mult_~m 0)) (not (= mult_~m 0)))} is VALID [2022-02-21 04:19:23,997 INFO L272 TraceCheckUtils]: 3: Hoare triple {2185#(and (<= mult_~m oldRank0) (not (< mult_~m 0)) (not (= mult_~m 0)))} call #t~ret5 := mult(~n, ~m - 1); {2138#(or unseeded (and (>= oldRank0 0) (> oldRank0 |mult_#in~m|)))} is VALID [2022-02-21 04:19:23,997 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 04:19:23,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:24,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:24,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,009 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2022-02-21 04:19:24,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 36 transitions. cyclomatic complexity: 6 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:24,104 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 36 transitions. cyclomatic complexity: 6. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 42 states and 46 transitions. Complement of second has 17 states. [2022-02-21 04:19:24,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:24,104 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:24,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. cyclomatic complexity: 6 [2022-02-21 04:19:24,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:24,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:24,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:24,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:24,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:24,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:24,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions. [2022-02-21 04:19:24,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:24,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:24,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:24,106 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 36 transitions. cyclomatic complexity: 6 [2022-02-21 04:19:24,107 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 04:19:24,107 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:24,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:24,108 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:24,108 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 46 transitions. cyclomatic complexity: 6 [2022-02-21 04:19:24,108 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:19:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:19:24,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:19:24,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 42 letters. Loop has 42 letters. [2022-02-21 04:19:24,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:19:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:19:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 32 letters. Loop has 32 letters. [2022-02-21 04:19:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:19:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:19:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 6 letters. [2022-02-21 04:19:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2022-02-21 04:19:24,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2022-02-21 04:19:24,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 36 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 46 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2022-02-21 04:19:24,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,122 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 04:19:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-02-21 04:19:24,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 12 letters. Loop has 4 letters. [2022-02-21 04:19:24,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 16 letters. Loop has 4 letters. [2022-02-21 04:19:24,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 12 letters. Loop has 8 letters. [2022-02-21 04:19:24,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 46 transitions. cyclomatic complexity: 6 [2022-02-21 04:19:24,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:24,125 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 16 states and 16 transitions. [2022-02-21 04:19:24,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 04:19:24,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 04:19:24,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 16 transitions. [2022-02-21 04:19:24,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:24,126 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-02-21 04:19:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 16 transitions. [2022-02-21 04:19:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 9. [2022-02-21 04:19:24,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:19:24,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 16 transitions. Second operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,127 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 16 transitions. Second operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,127 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:24,127 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-21 04:19:24,127 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-21 04:19:24,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:24,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:24,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 16 transitions. [2022-02-21 04:19:24,128 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states and 16 transitions. [2022-02-21 04:19:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:19:24,128 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-21 04:19:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-21 04:19:24,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:19:24,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:19:24,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:19:24,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:19:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-21 04:19:24,129 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-21 04:19:24,129 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-21 04:19:24,129 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:19:24,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 9 transitions. [2022-02-21 04:19:24,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:24,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:24,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:24,130 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 04:19:24,130 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 04:19:24,130 INFO L791 eck$LassoCheckResult]: Stem: 2261#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); 2262#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 2264#L29 assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; 2265#L33 assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); 2258#L36 call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1);< 2263#multENTRY [2022-02-21 04:19:24,130 INFO L793 eck$LassoCheckResult]: Loop: 2263#multENTRY ~n := #in~n;~m := #in~m; 2257#L18 assume !(~m < 0); 2259#L21 assume !(0 == ~m); 2260#L24 call #t~ret5 := mult(~n, ~m - 1);< 2263#multENTRY [2022-02-21 04:19:24,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:24,131 INFO L85 PathProgramCache]: Analyzing trace with hash 42056133, now seen corresponding path program 2 times [2022-02-21 04:19:24,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:24,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19073769] [2022-02-21 04:19:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:24,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:24,139 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:24,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash 929640, now seen corresponding path program 2 times [2022-02-21 04:19:24,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:24,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562214428] [2022-02-21 04:19:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:24,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:24,153 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:24,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 332752684, now seen corresponding path program 2 times [2022-02-21 04:19:24,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:19:24,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666066266] [2022-02-21 04:19:24,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:19:24,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:19:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:24,165 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:19:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:19:24,169 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:19:24,236 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:24,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:24,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:24,237 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:24,237 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:19:24,237 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,237 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:24,237 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:24,237 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration5_Loop [2022-02-21 04:19:24,237 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:24,237 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:24,238 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 04:19:24,239 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 04:19:24,240 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 04:19:24,242 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 04:19:24,243 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 04:19:24,247 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 04:19:24,249 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 04:19:24,316 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:24,316 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:19:24,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,318 INFO L229 MonitoredProcess]: Starting monitored process 57 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 04:19:24,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 04:19:24,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:24,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:24,340 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:24,340 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~n=0} Honda state: {mult_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:24,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-02-21 04:19:24,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,356 INFO L229 MonitoredProcess]: Starting monitored process 58 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 04:19:24,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 04:19:24,358 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:24,358 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:24,365 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:24,365 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_~m=0} Honda state: {mult_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:24,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:24,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,380 INFO L229 MonitoredProcess]: Starting monitored process 59 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 04:19:24,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 04:19:24,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:24,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:24,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:24,388 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#res=0} Honda state: {mult_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:24,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-02-21 04:19:24,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,404 INFO L229 MonitoredProcess]: Starting monitored process 60 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 04:19:24,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 04:19:24,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:24,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:24,415 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:19:24,415 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mult_#in~n=0} Honda state: {mult_#in~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:19:24,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 04:19:24,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,432 INFO L229 MonitoredProcess]: Starting monitored process 61 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 04:19:24,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 04:19:24,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:19:24,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:24,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-02-21 04:19:24,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,456 INFO L229 MonitoredProcess]: Starting monitored process 62 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 04:19:24,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 04:19:24,464 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:19:24,464 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:19:24,487 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:19:24,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 04:19:24,490 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:19:24,490 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:19:24,490 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:19:24,490 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:19:24,490 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:19:24,490 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,490 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:19:24,490 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:19:24,490 INFO L133 ssoRankerPreferences]: Filename of dumped script: MultCommutative-2.c_Iteration5_Loop [2022-02-21 04:19:24,490 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:19:24,490 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:19:24,491 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 04:19:24,503 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 04:19:24,505 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 04:19:24,506 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 04:19:24,518 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 04:19:24,520 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 04:19:24,524 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 04:19:24,590 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:19:24,590 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:19:24,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,591 INFO L229 MonitoredProcess]: Starting monitored process 63 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 04:19:24,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 04:19:24,594 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 04:19:24,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,619 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:24,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,635 INFO L229 MonitoredProcess]: Starting monitored process 64 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 04:19:24,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 04:19:24,637 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 04:19:24,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-02-21 04:19:24,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,679 INFO L229 MonitoredProcess]: Starting monitored process 65 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 04:19:24,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 04:19:24,681 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 04:19:24,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-02-21 04:19:24,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,704 INFO L229 MonitoredProcess]: Starting monitored process 66 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 04:19:24,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 04:19:24,708 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 04:19:24,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-02-21 04:19:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,731 INFO L229 MonitoredProcess]: Starting monitored process 67 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 04:19:24,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 04:19:24,733 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 04:19:24,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,740 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:19:24,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-02-21 04:19:24,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,756 INFO L229 MonitoredProcess]: Starting monitored process 68 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 04:19:24,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 04:19:24,758 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 04:19:24,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:19:24,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:19:24,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:19:24,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:19:24,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:19:24,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:19:24,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:19:24,766 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:19:24,769 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 04:19:24,769 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:19:24,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:19:24,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:19:24,770 INFO L229 MonitoredProcess]: Starting monitored process 69 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 04:19:24,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 04:19:24,772 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:19:24,772 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:19:24,772 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:19:24,772 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(mult_#in~m) = 1*mult_#in~m Supporting invariants [] [2022-02-21 04:19:24,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-02-21 04:19:24,790 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:19:24,792 INFO L390 LassoCheck]: Loop: "~n := #in~n;~m := #in~m;" "assume !(~m < 0);" "assume !(0 == ~m);" "call #t~ret5 := mult(~n, ~m - 1);"< [2022-02-21 04:19:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:19:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:19:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:24,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {2307#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {2307#unseeded} is VALID [2022-02-21 04:19:24,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {2307#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~m~0#1, main_~n~0#1, main_~res1~0#1, main_~res2~0#1;main_~m~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2307#unseeded} is VALID [2022-02-21 04:19:24,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {2307#unseeded} assume !(main_~m~0#1 < 0 || main_~m~0#1 > 46340);main_~n~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2307#unseeded} is VALID [2022-02-21 04:19:24,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {2307#unseeded} assume !(main_~n~0#1 < 0 || main_~n~0#1 > 46340); {2307#unseeded} is VALID [2022-02-21 04:19:24,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {2307#unseeded} call main_#t~ret8#1 := mult(main_~m~0#1, main_~n~0#1); {2307#unseeded} is VALID [2022-02-21 04:19:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 04:19:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:19:24,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:19:24,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {2310#(>= oldRank0 |mult_#in~m|)} ~n := #in~n;~m := #in~m; {2337#(<= mult_~m oldRank0)} is VALID [2022-02-21 04:19:24,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {2337#(<= mult_~m oldRank0)} assume !(~m < 0); {2341#(and (<= mult_~m oldRank0) (not (< mult_~m 0)))} is VALID [2022-02-21 04:19:24,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {2341#(and (<= mult_~m oldRank0) (not (< mult_~m 0)))} assume !(0 == ~m); {2345#(and (<= mult_~m oldRank0) (not (< mult_~m 0)) (not (= mult_~m 0)))} is VALID [2022-02-21 04:19:24,904 INFO L272 TraceCheckUtils]: 3: Hoare triple {2345#(and (<= mult_~m oldRank0) (not (< mult_~m 0)) (not (= mult_~m 0)))} call #t~ret5 := mult(~n, ~m - 1); {2320#(or unseeded (and (>= oldRank0 0) (> oldRank0 |mult_#in~m|)))} is VALID [2022-02-21 04:19:24,904 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 04:19:24,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:19:24,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:19:24,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,919 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 04:19:24,919 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1 Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,969 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 9 transitions. cyclomatic complexity: 1. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 19 transitions. Complement of second has 15 states. [2022-02-21 04:19:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 04:19:24,970 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:24,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 9 transitions. cyclomatic complexity: 1 [2022-02-21 04:19:24,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:24,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:24,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,970 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:24,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:19:24,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:19:24,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 19 transitions. [2022-02-21 04:19:24,970 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:19:24,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:19:24,971 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 9 transitions. cyclomatic complexity: 1 [2022-02-21 04:19:24,971 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 04:19:24,971 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 04:19:24,971 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:19:24,971 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 19 transitions. cyclomatic complexity: 1 [2022-02-21 04:19:24,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 19 transitions. cyclomatic complexity: 1 [2022-02-21 04:19:24,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:19:24,971 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:19:24,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:19:24,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 19 letters. Loop has 19 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:19:24,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 04:19:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 9 letters. Loop has 9 letters. [2022-02-21 04:19:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 04:19:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 5 letters. [2022-02-21 04:19:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:19:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:19:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 4 letters. [2022-02-21 04:19:24,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:19:24,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:19:24,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 7 letters. Loop has 4 letters. [2022-02-21 04:19:24,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:19:24,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:19:24,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 8 letters. Loop has 4 letters. [2022-02-21 04:19:24,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:19:24,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:19:24,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:19:24,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 9 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 19 transitions. cyclomatic complexity: 1 Stem has 1 letters. Loop has 4 letters. [2022-02-21 04:19:24,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,979 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:19:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:19:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2022-02-21 04:19:24,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 04:19:24,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 04:19:24,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 5 letters. Loop has 8 letters. [2022-02-21 04:19:24,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:19:24,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 19 transitions. cyclomatic complexity: 1 [2022-02-21 04:19:24,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:19:24,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2022-02-21 04:19:24,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:19:24,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:19:24,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:19:24,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:19:24,980 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:19:24,981 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:19:24,981 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:19:24,981 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:19:24,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:19:24,981 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:19:24,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:19:24,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:19:24 BoogieIcfgContainer [2022-02-21 04:19:24,985 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:19:24,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:19:24,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:19:24,986 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:19:24,986 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:19:18" (3/4) ... [2022-02-21 04:19:24,987 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:19:24,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:19:24,988 INFO L158 Benchmark]: Toolchain (without parser) took 6678.61ms. Allocated memory was 75.5MB in the beginning and 117.4MB in the end (delta: 41.9MB). Free memory was 42.7MB in the beginning and 57.0MB in the end (delta: -14.3MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2022-02-21 04:19:24,988 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:19:24,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.32ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 42.6MB in the beginning and 73.7MB in the end (delta: -31.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-02-21 04:19:24,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.78ms. Allocated memory is still 96.5MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:19:24,989 INFO L158 Benchmark]: Boogie Preprocessor took 25.39ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 71.1MB in the end (delta: 929.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:19:24,989 INFO L158 Benchmark]: RCFGBuilder took 233.23ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 61.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:19:24,989 INFO L158 Benchmark]: BuchiAutomizer took 6156.02ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 61.0MB in the beginning and 57.0MB in the end (delta: 4.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-02-21 04:19:24,989 INFO L158 Benchmark]: Witness Printer took 1.97ms. Allocated memory is still 117.4MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:19:24,990 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.16ms. Allocated memory is still 75.5MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.32ms. Allocated memory was 75.5MB in the beginning and 96.5MB in the end (delta: 21.0MB). Free memory was 42.6MB in the beginning and 73.7MB in the end (delta: -31.1MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.78ms. Allocated memory is still 96.5MB. Free memory was 73.7MB in the beginning and 72.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.39ms. Allocated memory is still 96.5MB. Free memory was 72.0MB in the beginning and 71.1MB in the end (delta: 929.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 233.23ms. Allocated memory is still 96.5MB. Free memory was 71.1MB in the beginning and 61.0MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6156.02ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 61.0MB in the beginning and 57.0MB in the end (delta: 4.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Witness Printer took 1.97ms. Allocated memory is still 117.4MB. Free memory is still 57.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * \old(m) and consists of 4 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function -1 * \old(m) and consists of 5 locations. One deterministic module has affine ranking function \old(m) and consists of 6 locations. One deterministic module has affine ranking function \old(m) and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.2s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 53 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 2. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 128 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf94 smp85 dnf100 smp100 tf113 neg97 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 23 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:19:25,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-02-21 04:19:25,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE