./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a21396952d3c1812f4afc7acd202b7f8106d7865729c99629f4c895e2f73a4f9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:42,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:42,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:42,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:42,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:42,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:42,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:42,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:42,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:42,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:42,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:42,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:42,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:42,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:42,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:42,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:42,542 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:42,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:42,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:42,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:42,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:42,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:42,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:42,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:42,552 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:42,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:42,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:42,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:42,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:42,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:42,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:42,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:42,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:42,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:42,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:42,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:42,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:42,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:42,560 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:42,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:42,561 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:42,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:35:42,592 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:42,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:42,593 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:42,593 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:42,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:42,594 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:42,594 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:42,594 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:42,595 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:42,595 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:42,595 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:42,595 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:42,595 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:42,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:42,596 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:42,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:42,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:42,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:42,596 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:42,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:42,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:42,597 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:42,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:42,597 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:42,597 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:42,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:42,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:42,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:42,599 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:42,599 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a21396952d3c1812f4afc7acd202b7f8106d7865729c99629f4c895e2f73a4f9 [2022-02-21 03:35:42,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:42,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:42,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:42,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:42,843 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:42,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i [2022-02-21 03:35:42,917 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6841587c0/a7ab46b2829041d68b2f39125ef9348d/FLAGffdeebe48 [2022-02-21 03:35:43,303 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:43,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11C.i [2022-02-21 03:35:43,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6841587c0/a7ab46b2829041d68b2f39125ef9348d/FLAGffdeebe48 [2022-02-21 03:35:43,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6841587c0/a7ab46b2829041d68b2f39125ef9348d [2022-02-21 03:35:43,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:43,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:43,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:43,738 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:43,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:43,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f4537c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43, skipping insertion in model container [2022-02-21 03:35:43,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:43,758 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:43,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:43,904 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:43,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:43,937 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:43,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43 WrapperNode [2022-02-21 03:35:43,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:43,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:43,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:43,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:43,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,974 INFO L137 Inliner]: procedures = 11, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-21 03:35:43,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:43,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:43,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:43,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:43,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:43,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:43,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:43,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:43,995 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:43,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (1/1) ... [2022-02-21 03:35:44,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:44,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:44,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:44,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:35:44,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-02-21 03:35:44,050 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-02-21 03:35:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:44,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:44,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:44,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:44,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:44,107 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:44,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:44,341 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:44,352 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:44,353 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:35:44,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:44 BoogieIcfgContainer [2022-02-21 03:35:44,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:44,355 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:44,356 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:44,363 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:44,364 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:44,365 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:43" (1/3) ... [2022-02-21 03:35:44,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e23a154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:44, skipping insertion in model container [2022-02-21 03:35:44,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:44,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:43" (2/3) ... [2022-02-21 03:35:44,367 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4e23a154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:44, skipping insertion in model container [2022-02-21 03:35:44,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:44,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:44" (3/3) ... [2022-02-21 03:35:44,369 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C.i [2022-02-21 03:35:44,423 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:44,423 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:44,424 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:44,424 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:44,424 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:44,424 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:44,424 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:44,424 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:44,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:44,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:44,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:44,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:44,494 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:44,494 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:44,494 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:44,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:44,503 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:44,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:44,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:44,504 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:44,504 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:44,510 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; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 10#L31-3true [2022-02-21 03:35:44,512 INFO L793 eck$LassoCheckResult]: Loop: 10#L31-3true call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 15#L31-1true assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 18#L35true assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 20#L39true call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 13#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 11#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 17#recFINALtrue assume true; 16#recEXITtrue >#44#return; 8#L39-1true assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 4#L39-3true call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 10#L31-3true [2022-02-21 03:35:44,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:44,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2022-02-21 03:35:44,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:44,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755419770] [2022-02-21 03:35:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:44,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:44,660 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:44,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2022-02-21 03:35:44,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:44,664 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803015356] [2022-02-21 03:35:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-21 03:35:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:44,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:44,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:44,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} assume true; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:44,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} #44#return; {25#false} is VALID [2022-02-21 03:35:44,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {24#true} is VALID [2022-02-21 03:35:44,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {26#(= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|)} is VALID [2022-02-21 03:35:44,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#(= (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1|)} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} is VALID [2022-02-21 03:35:44,867 INFO L272 TraceCheckUtils]: 3: Hoare triple {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:44,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:44,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:44,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} assume true; {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} is VALID [2022-02-21 03:35:44,871 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34#(<= (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0)} {27#(<= 0 (select (select |#memory_int| |ULTIMATE.start_main_~pp~0#1.base|) |ULTIMATE.start_main_~pp~0#1.offset|))} #44#return; {25#false} is VALID [2022-02-21 03:35:44,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {25#false} is VALID [2022-02-21 03:35:44,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {25#false} is VALID [2022-02-21 03:35:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:44,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:44,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803015356] [2022-02-21 03:35:44,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803015356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:44,874 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:44,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-21 03:35:44,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635657861] [2022-02-21 03:35:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:44,883 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:44,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:44,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:35:44,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:35:44,920 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:45,169 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-02-21 03:35:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:35:45,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:35:45,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:45,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2022-02-21 03:35:45,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:45,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2022-02-21 03:35:45,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:35:45,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:35:45,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2022-02-21 03:35:45,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:45,207 INFO L681 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2022-02-21 03:35:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-21 03:35:45,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:45,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:45,227 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:45,228 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:45,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:45,230 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:35:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:45,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:45,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:45,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states and 19 transitions. [2022-02-21 03:35:45,231 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 16 states and 19 transitions. [2022-02-21 03:35:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:45,232 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-02-21 03:35:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:45,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:45,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:45,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:45,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 03:35:45,235 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:45,235 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:35:45,235 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:45,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:35:45,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:35:45,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:45,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:45,237 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:45,237 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:45,237 INFO L791 eck$LassoCheckResult]: Stem: 59#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 58#L31-3 [2022-02-21 03:35:45,237 INFO L793 eck$LassoCheckResult]: Loop: 58#L31-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 66#L31-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 70#L35 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 62#L39 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 69#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 67#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 63#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 69#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 67#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 68#recFINAL assume true; 71#recEXIT >#42#return; 61#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 64#recFINAL assume true; 72#recEXIT >#44#return; 65#L39-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 57#L39-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 58#L31-3 [2022-02-21 03:35:45,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:45,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2022-02-21 03:35:45,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:45,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033911470] [2022-02-21 03:35:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:45,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:45,269 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:45,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2022-02-21 03:35:45,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:45,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334712831] [2022-02-21 03:35:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:45,327 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:45,372 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2022-02-21 03:35:45,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:45,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667513009] [2022-02-21 03:35:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:45,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:45,430 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:45,465 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:48,081 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:48,082 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:48,082 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:48,082 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:48,082 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:48,082 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,082 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:48,082 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:48,082 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration2_Lasso [2022-02-21 03:35:48,082 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:48,083 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:48,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:48,365 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:48,366 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:48,732 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:48,735 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:48,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:48,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:48,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:48,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:48,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:48,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:48,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:48,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:48,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:48,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:35:48,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:48,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:48,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:48,810 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:48,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:35:48,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:48,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:48,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:48,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:48,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:48,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:48,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:48,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:48,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:48,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:48,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:48,872 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:48,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:48,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:48,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:48,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:48,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:48,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:48,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:48,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:35:48,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:48,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:48,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:48,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:48,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:48,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:48,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:48,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:48,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:48,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:48,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:48,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:48,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:35:48,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:48,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:48,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:48,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:49,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:49,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:35:49,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,052 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:35:49,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,112 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:35:49,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:35:49,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,207 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:35:49,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,219 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,219 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,235 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,261 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 03:35:49,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,262 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:35:49,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,320 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:35:49,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,378 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,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 03:35:49,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:35:49,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,437 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:35:49,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,449 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,449 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:35:49,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,470 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:35:49,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:49,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:49,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:49,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:49,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,509 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:35:49,511 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:49,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:49,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:49,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:49,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:49,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:49,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:49,527 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:49,537 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:35:49,537 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:35:49,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:49,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,540 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:49,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:35:49,568 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:49,596 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:49,596 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:49,597 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0#1.base) ULTIMATE.start_main_~qq~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:35:49,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:49,639 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:35:49,645 INFO L390 LassoCheck]: Loop: "call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4);" "assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0;" "assume true;" >"#42#return;" "~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0;" "assume true;" >"#44#return;" "assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1;" "call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1;" [2022-02-21 03:35:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:49,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {114#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {114#unseeded} is VALID [2022-02-21 03:35:49,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {114#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {114#unseeded} is VALID [2022-02-21 03:35:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:35:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:49,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:35:49,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-02-21 03:35:49,915 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:35:49,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:35:49,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:35:50,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {117#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {140#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (<= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} is VALID [2022-02-21 03:35:50,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#(and (= (select |#valid| |ULTIMATE.start_main_~qq~0#1.base|) 1) (<= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)))} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {144#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) oldRank0))} is VALID [2022-02-21 03:35:50,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|) oldRank0))} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} is VALID [2022-02-21 03:35:50,122 INFO L272 TraceCheckUtils]: 3: Hoare triple {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} assume true; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {152#(<= |old(oldRank0)| oldRank0)} {152#(<= |old(oldRank0)| oldRank0)} #42#return; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,128 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#(<= |old(oldRank0)| oldRank0)} assume true; {152#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:50,129 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {152#(<= |old(oldRank0)| oldRank0)} {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} #44#return; {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} is VALID [2022-02-21 03:35:50,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {148#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0))} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {186#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ite13#1| 1) 0))} is VALID [2022-02-21 03:35:50,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#(and (<= |ULTIMATE.start_main_#t~mem14#1| oldRank0) (< 1 oldRank0) (<= (+ |ULTIMATE.start_main_#t~ite13#1| 1) 0))} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {132#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~qq~0#1.base|) |ULTIMATE.start_main_~qq~0#1.offset|))))} is VALID [2022-02-21 03:35:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:35:50,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:50,184 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 03:35:50,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:50,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,188 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-02-21 03:35:50,189 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:50,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:50,444 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 62 states and 73 transitions. Complement of second has 17 states. [2022-02-21 03:35:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:50,445 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:50,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:50,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:50,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:50,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:50,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:50,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:50,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:50,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2022-02-21 03:35:50,450 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:50,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:50,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:50,452 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:35:50,456 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:35:50,456 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:50,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:35:50,458 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:50,458 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 62 states and 73 transitions. cyclomatic complexity: 16 [2022-02-21 03:35:50,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:35:50,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:50,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:50,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:50,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:50,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:50,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:50,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:50,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:50,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:50,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:50,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 62 letters. Loop has 62 letters. [2022-02-21 03:35:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:50,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:50,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:50,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:50,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:50,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:50,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:50,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:50,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:50,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:50,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:50,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:50,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:50,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:50,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 16 letters. [2022-02-21 03:35:50,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:50,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:50,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 16 letters. [2022-02-21 03:35:50,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:50,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:50,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:50,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:50,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:50,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:50,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:50,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:50,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 16 letters. [2022-02-21 03:35:50,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:35:50,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:50,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:50,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 7 letters. [2022-02-21 03:35:50,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:50,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:50,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:50,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:50,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:50,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:50,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:50,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:50,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:50,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:50,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:50,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:50,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:50,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:50,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:50,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:50,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:50,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:50,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:50,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:50,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:50,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:50,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:50,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:50,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:50,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:50,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:50,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:50,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:50,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:50,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:50,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:50,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 33 letters. Loop has 16 letters. [2022-02-21 03:35:50,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:50,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:50,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:50,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:50,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:50,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 73 transitions. cyclomatic complexity: 16 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:50,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,496 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:35:50,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2022-02-21 03:35:50,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2022-02-21 03:35:50,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:50,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2022-02-21 03:35:50,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:50,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. cyclomatic complexity: 16 [2022-02-21 03:35:50,503 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:50,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2022-02-21 03:35:50,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-02-21 03:35:50,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-02-21 03:35:50,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2022-02-21 03:35:50,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:50,507 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-02-21 03:35:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2022-02-21 03:35:50,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2022-02-21 03:35:50,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:50,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:50,516 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:50,517 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:50,517 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:50,537 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-02-21 03:35:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-02-21 03:35:50,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:50,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:50,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 56 states and 67 transitions. [2022-02-21 03:35:50,541 INFO L87 Difference]: Start difference. First operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Second operand 56 states and 67 transitions. [2022-02-21 03:35:50,542 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:50,554 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2022-02-21 03:35:50,554 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2022-02-21 03:35:50,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:50,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:50,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:50,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-21 03:35:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-02-21 03:35:50,563 INFO L704 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-21 03:35:50,563 INFO L587 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-21 03:35:50,563 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:50,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2022-02-21 03:35:50,564 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:50,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:50,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:50,565 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:50,565 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:50,565 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 293#L31-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 296#L31-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 306#L35 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 298#L39 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 302#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 297#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 284#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 300#recENTRY [2022-02-21 03:35:50,565 INFO L793 eck$LassoCheckResult]: Loop: 300#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 327#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 285#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 300#recENTRY [2022-02-21 03:35:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2022-02-21 03:35:50,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:50,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718060262] [2022-02-21 03:35:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:50,594 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:50,613 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:50,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2022-02-21 03:35:50,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:50,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229643980] [2022-02-21 03:35:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:50,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:50,633 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:50,634 INFO L85 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2022-02-21 03:35:50,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:50,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79325452] [2022-02-21 03:35:50,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:50,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:50,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:50,688 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:54,686 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:54,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:54,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:54,686 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:54,686 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:54,686 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:54,686 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:54,686 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:54,686 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration3_Lasso [2022-02-21 03:35:54,686 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:54,686 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:54,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:54,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,028 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:35:55,030 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:35:55,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:55,620 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:55,620 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:55,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:55,624 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:55,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:55,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:55,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:55,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:55,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:55,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:55,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:55,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:55,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:35:55,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:55,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:55,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:55,681 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:55,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:55,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:55,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:55,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:55,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:55,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:55,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:55,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:55,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:35:55,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:55,740 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 03:35:55,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:55,742 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:55,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:55,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:55,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:55,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:55,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:55,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:55,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:55,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:55,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:35:55,779 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:55,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:55,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:55,805 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:55,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:55,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:55,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:55,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:55,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:55,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:55,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:55,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:55,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:35:55,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:55,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:55,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:55,862 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:55,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:35:55,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:55,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:55,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:55,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:55,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:55,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:55,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:55,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:55,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:55,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:55,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:55,908 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:55,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:55,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:55,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:55,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:55,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:55,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:55,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:55,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:55,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:35:55,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:55,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:35:55,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:55,953 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:55,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:35:55,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:55,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:55,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:55,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:55,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:55,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:55,961 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:55,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:55,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:55,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:35:55,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:55,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:55,978 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:55,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:35:55,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:55,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:55,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:55,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:55,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:55,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:55,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:55,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:55,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:35:56,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,003 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 03:35:56,004 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 03:35:56,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:35:56,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,028 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 03:35:56,028 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 03:35:56,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:35:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,052 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 03:35:56,053 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 03:35:56,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,063 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,070 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:35:56,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,086 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 03:35:56,087 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 03:35:56,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,111 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 03:35:56,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,113 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 03:35:56,113 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 03:35:56,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:56,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,137 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 03:35:56,138 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 03:35:56,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,163 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 03:35:56,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,164 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 03:35:56,165 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 03:35:56,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,187 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 03:35:56,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,189 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 03:35:56,199 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 03:35:56,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,204 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,221 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 03:35:56,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,223 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 03:35:56,223 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 03:35:56,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,245 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 03:35:56,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,247 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 03:35:56,249 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 03:35:56,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,255 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,274 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 03:35:56,275 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 03:35:56,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:56,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,290 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:56,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:56,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,328 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 03:35:56,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,332 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 03:35:56,333 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 03:35:56,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,344 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,344 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:35:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,367 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 03:35:56,373 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 03:35:56,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,407 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 03:35:56,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,408 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 03:35:56,409 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 03:35:56,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:56,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-02-21 03:35:56,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,447 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 03:35:56,449 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 03:35:56,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:56,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:56,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:56,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:56,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:56,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:56,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:56,468 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:56,483 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:35:56,483 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-02-21 03:35:56,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:56,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:56,484 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 03:35:56,485 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 03:35:56,487 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:56,493 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:35:56,493 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:56,493 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int) rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select old(#memory_int) rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [1*v_rep(select (select old(#memory_int) rec_#in~op.base) 0)_1 - 1*v_rep(select (select #memory_int rec_#in~op.base) 0)_1 >= 0] [2022-02-21 03:35:56,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:56,528 INFO L297 tatePredicateManager]: 1 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:35:56,537 INFO L390 LassoCheck]: Loop: "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< [2022-02-21 03:35:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:56,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:56,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:35:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:56,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:56,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {610#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {610#unseeded} is VALID [2022-02-21 03:35:56,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {610#unseeded} is VALID [2022-02-21 03:35:56,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {610#unseeded} is VALID [2022-02-21 03:35:56,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {610#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {610#unseeded} is VALID [2022-02-21 03:35:56,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {610#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {610#unseeded} is VALID [2022-02-21 03:35:56,679 INFO L272 TraceCheckUtils]: 5: Hoare triple {610#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {610#unseeded} is VALID [2022-02-21 03:35:56,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#unseeded} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {610#unseeded} is VALID [2022-02-21 03:35:56,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#unseeded} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {670#(and (<= 0 rec_~ip~0.offset) unseeded (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:35:56,681 INFO L272 TraceCheckUtils]: 8: Hoare triple {670#(and (<= 0 rec_~ip~0.offset) unseeded (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {640#(and (>= (+ (* (- 1) (select (select |#memory_int| |rec_#in~op.base|) 0)) (select (select |old(#memory_int)| |rec_#in~op.base|) 0)) 0) unseeded (= 0 |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:56,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:35:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:56,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:56,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-02-21 03:35:56,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-21 03:35:56,888 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-02-21 03:35:56,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2022-02-21 03:35:56,949 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 03:35:57,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {641#(and (>= (+ (* (- 1) (select (select |#memory_int| |rec_#in~op.base|) 0)) (select (select |old(#memory_int)| |rec_#in~op.base|) 0)) 0) (>= oldRank0 (+ (* 2 (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|)) 1)) (= 0 |rec_#in~op.offset|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {674#(and (<= (select (select |#memory_int| rec_~op.base) 0) (div (+ (- 1) oldRank0) 2)) (= rec_~op.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:35:57,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#(and (<= (select (select |#memory_int| rec_~op.base) 0) (div (+ (- 1) oldRank0) 2)) (= rec_~op.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {678#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:35:57,010 INFO L272 TraceCheckUtils]: 2: Hoare triple {678#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {643#(and (>= (+ (* (- 1) (select (select |#memory_int| |rec_#in~op.base|) 0)) (select (select |old(#memory_int)| |rec_#in~op.base|) 0)) 0) (= 0 |rec_#in~op.offset|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded))} is VALID [2022-02-21 03:35:57,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:57,011 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), 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 03:35:57,024 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 03:35:57,024 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 03:35:57,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,025 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 03:35:57,025 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 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), 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 03:35:57,198 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. 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), 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 99 states and 122 transitions. Complement of second has 18 states. [2022-02-21 03:35:57,198 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 03:35:57,198 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:57,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. cyclomatic complexity: 14 [2022-02-21 03:35:57,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:57,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:57,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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), 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 03:35:57,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:57,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:57,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:57,200 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 122 transitions. [2022-02-21 03:35:57,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:57,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:57,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:57,202 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 51 states and 60 transitions. cyclomatic complexity: 14 [2022-02-21 03:35:57,205 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:35:57,205 INFO L70 LassoExtractor]: Start lassoExtractor. 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), 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 03:35:57,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:57,206 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:57,206 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 99 states and 122 transitions. cyclomatic complexity: 30 [2022-02-21 03:35:57,208 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:35:57,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,208 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 03:35:57,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:35:57,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,209 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 2 letters. Loop has 3 letters. [2022-02-21 03:35:57,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:35:57,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,210 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 99 letters. Loop has 99 letters. [2022-02-21 03:35:57,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,210 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 99 letters. Loop has 99 letters. [2022-02-21 03:35:57,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 99 letters. Loop has 99 letters. [2022-02-21 03:35:57,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:35:57,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,211 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 51 letters. Loop has 51 letters. [2022-02-21 03:35:57,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 51 letters. Loop has 51 letters. [2022-02-21 03:35:57,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:35:57,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,211 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 6 letters. Loop has 6 letters. [2022-02-21 03:35:57,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:35:57,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:57,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,212 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 03:35:57,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:57,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,213 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 03:35:57,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:57,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,213 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 03:35:57,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:35:57,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,214 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,215 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 3 letters. [2022-02-21 03:35:57,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,215 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,216 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,217 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,217 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,218 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,219 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,219 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,220 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:35:57,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 2 letters. Loop has 3 letters. [2022-02-21 03:35:57,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:35:57,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:57,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,222 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 3 letters. [2022-02-21 03:35:57,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:35:57,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,222 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:57,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,223 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 21 letters. Loop has 16 letters. [2022-02-21 03:35:57,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,224 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 17 letters. Loop has 16 letters. [2022-02-21 03:35:57,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,224 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,225 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 18 letters. Loop has 16 letters. [2022-02-21 03:35:57,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,226 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 19 letters. Loop has 16 letters. [2022-02-21 03:35:57,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,226 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 20 letters. Loop has 16 letters. [2022-02-21 03:35:57,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,227 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 16 letters. [2022-02-21 03:35:57,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 3 letters. [2022-02-21 03:35:57,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,228 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 27 letters. Loop has 3 letters. [2022-02-21 03:35:57,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 27 letters. Loop has 3 letters. [2022-02-21 03:35:57,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:35:57,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,228 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 25 letters. Loop has 3 letters. [2022-02-21 03:35:57,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:35:57,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 51 states and 60 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:35:57,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,229 INFO L84 BuchiAccepts]: Start buchiAccepts 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), 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 26 letters. Loop has 3 letters. [2022-02-21 03:35:57,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 122 transitions. cyclomatic complexity: 30 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:35:57,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,229 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. 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), 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 03:35:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-02-21 03:35:57,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:57,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:35:57,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:35:57,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:57,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. cyclomatic complexity: 30 [2022-02-21 03:35:57,240 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:57,244 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2022-02-21 03:35:57,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2022-02-21 03:35:57,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 03:35:57,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2022-02-21 03:35:57,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:57,245 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-02-21 03:35:57,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2022-02-21 03:35:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-02-21 03:35:57,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:57,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:35:57,251 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:35:57,252 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:35:57,252 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:57,258 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2022-02-21 03:35:57,258 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2022-02-21 03:35:57,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:57,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:57,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) Second operand 87 states and 110 transitions. [2022-02-21 03:35:57,260 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) Second operand 87 states and 110 transitions. [2022-02-21 03:35:57,260 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:57,267 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-02-21 03:35:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-02-21 03:35:57,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:57,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:57,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:57,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 14 states have call successors, (14), 11 states have call predecessors, (14), 10 states have return successors, (19), 8 states have call predecessors, (19), 14 states have call successors, (19) [2022-02-21 03:35:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2022-02-21 03:35:57,270 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-02-21 03:35:57,270 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2022-02-21 03:35:57,271 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:57,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2022-02-21 03:35:57,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2022-02-21 03:35:57,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:57,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:57,279 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:57,279 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:57,279 INFO L791 eck$LassoCheckResult]: Stem: 810#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 811#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 826#L31-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 828#L31-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 879#L35 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 853#L39 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 878#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 877#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 815#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 874#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 875#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 843#recFINAL assume true; 844#recEXIT >#42#return; 860#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 858#recFINAL assume true; 852#recEXIT >#44#return; 824#L39-1 assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; 806#L39-3 [2022-02-21 03:35:57,279 INFO L793 eck$LassoCheckResult]: Loop: 806#L39-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 807#L31-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 861#L31-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 859#L35 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 848#L39 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 849#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 865#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 856#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 849#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 865#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 866#recFINAL assume true; 867#recEXIT >#42#return; 857#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 864#recFINAL assume true; 855#recEXIT >#44#return; 851#L39-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 806#L39-3 [2022-02-21 03:35:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:57,279 INFO L85 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2022-02-21 03:35:57,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:57,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349673001] [2022-02-21 03:35:57,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:57,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-21 03:35:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {1339#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:57,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {1348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:57,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {1339#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1340#(= 0 (+ |rec_#t~mem1| (* (- 1) (select (select |#memory_int| rec_~op.base) rec_~op.offset))))} is VALID [2022-02-21 03:35:57,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1340#(= 0 (+ |rec_#t~mem1| (* (- 1) (select (select |#memory_int| rec_~op.base) rec_~op.offset))))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:35:57,445 INFO L272 TraceCheckUtils]: 2: Hoare triple {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1339#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:57,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {1339#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:57,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {1348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,448 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:57,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:57,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:57,450 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1326#true} #44#return; {1338#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:35:57,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {1326#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1326#true} is VALID [2022-02-21 03:35:57,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1326#true} is VALID [2022-02-21 03:35:57,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:57,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {1326#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:57,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {1326#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:57,452 INFO L272 TraceCheckUtils]: 5: Hoare triple {1326#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1339#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:57,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {1339#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1340#(= 0 (+ |rec_#t~mem1| (* (- 1) (select (select |#memory_int| rec_~op.base) rec_~op.offset))))} is VALID [2022-02-21 03:35:57,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {1340#(= 0 (+ |rec_#t~mem1| (* (- 1) (select (select |#memory_int| rec_~op.base) rec_~op.offset))))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:35:57,454 INFO L272 TraceCheckUtils]: 8: Hoare triple {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1339#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:57,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1339#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:57,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {1348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} assume true; {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} is VALID [2022-02-21 03:35:57,456 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1349#(and (<= (+ |rec_#res| 1) 0) (<= (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) |rec_#res|))} {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:57,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:57,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:57,458 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1326#true} #44#return; {1338#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:35:57,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {1338#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1327#false} is VALID [2022-02-21 03:35:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:57,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:57,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349673001] [2022-02-21 03:35:57,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349673001] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:57,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137686163] [2022-02-21 03:35:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:57,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:57,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:57,460 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:57,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-02-21 03:35:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-21 03:35:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:57,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:57,669 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:35:57,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-02-21 03:35:57,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-02-21 03:35:58,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {1326#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1326#true} is VALID [2022-02-21 03:35:58,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1326#true} is VALID [2022-02-21 03:35:58,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:58,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {1326#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:58,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {1326#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:58,045 INFO L272 TraceCheckUtils]: 5: Hoare triple {1326#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1326#true} is VALID [2022-02-21 03:35:58,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1371#(<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} is VALID [2022-02-21 03:35:58,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {1371#(<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {1375#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:35:58,047 INFO L272 TraceCheckUtils]: 8: Hoare triple {1375#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1379#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:58,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1379#(= |#memory_int| |old(#memory_int)|)} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1383#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| rec_~op.base) rec_~op.offset) |rec_#t~mem1|) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} is VALID [2022-02-21 03:35:58,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {1383#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| rec_~op.base) rec_~op.offset) |rec_#t~mem1|) (= |rec_#in~op.base| rec_~op.base) (= rec_~op.offset |rec_#in~op.offset|))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1387#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} is VALID [2022-02-21 03:35:58,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {1387#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} assume true; {1387#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} is VALID [2022-02-21 03:35:58,050 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1387#(and (< (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 0) (= |#memory_int| |old(#memory_int)|) (= |rec_#res| (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)))} {1375#(and (<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1)) (<= 0 rec_~ip~0.offset) (<= rec_~ip~0.offset 0))} #42#return; {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:58,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:58,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:58,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1326#true} #44#return; {1338#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:35:58,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {1338#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1327#false} is VALID [2022-02-21 03:35:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:58,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:58,964 WARN L756 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-02-21 03:35:59,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {1338#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} assume !(-1 == main_#t~ret12#1);main_#t~ite13#1 := 1; {1327#false} is VALID [2022-02-21 03:35:59,630 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} {1326#true} #44#return; {1338#(= (- 1) |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-21 03:35:59,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} assume true; {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:59,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; {1347#(and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1)))} is VALID [2022-02-21 03:35:59,632 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1424#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} #42#return; {1346#(and (<= 0 (+ |rec_#t~ret5| 1)) (<= (+ |rec_#t~ret5| 1) 0))} is VALID [2022-02-21 03:35:59,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {1424#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} assume true; {1424#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} is VALID [2022-02-21 03:35:59,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {1431#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1) 0) (<= 0 (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1))) (not (< |rec_#t~mem1| 0)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {1424#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ |rec_#res| 1) 0) (<= 0 (+ |rec_#res| 1))))} is VALID [2022-02-21 03:35:59,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {1435#(or (< (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0) (<= 0 (+ (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 1)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1431#(or (not (<= 0 (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1))) (and (<= (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1) 0) (<= 0 (+ (select (select |#memory_int| rec_~op.base) rec_~op.offset) 1))) (not (< |rec_#t~mem1| 0)))} is VALID [2022-02-21 03:35:59,635 INFO L272 TraceCheckUtils]: 8: Hoare triple {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {1435#(or (< (+ (select (select |old(#memory_int)| |rec_#in~op.base|) |rec_#in~op.offset|) 1) 0) (<= 0 (+ (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|) 1)))} is VALID [2022-02-21 03:35:59,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {1439#(or (<= 0 (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (< |rec_#t~mem1| 0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {1341#(<= 0 (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1))} is VALID [2022-02-21 03:35:59,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {1326#true} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {1439#(or (<= 0 (select (select |#memory_int| rec_~op.base) rec_~op.offset)) (< |rec_#t~mem1| 0))} is VALID [2022-02-21 03:35:59,638 INFO L272 TraceCheckUtils]: 5: Hoare triple {1326#true} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {1326#true} is VALID [2022-02-21 03:35:59,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {1326#true} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:59,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {1326#true} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:59,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {1326#true} is VALID [2022-02-21 03:35:59,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {1326#true} is VALID [2022-02-21 03:35:59,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {1326#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1326#true} is VALID [2022-02-21 03:35:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:59,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137686163] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:59,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:59,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-21 03:35:59,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365794788] [2022-02-21 03:35:59,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:59,641 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:35:59,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2022-02-21 03:35:59,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:59,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11948549] [2022-02-21 03:35:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:59,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:59,687 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:01,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:01,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-21 03:36:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:36:01,194 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand has 19 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:01,707 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2022-02-21 03:36:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-21 03:36:01,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 16 states have (on average 1.4375) internal successors, (23), 14 states have internal predecessors, (23), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:01,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:01,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 130 transitions. [2022-02-21 03:36:01,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 60 states and 77 transitions. [2022-02-21 03:36:01,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:36:01,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:36:01,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 77 transitions. [2022-02-21 03:36:01,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:01,757 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 77 transitions. [2022-02-21 03:36:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 77 transitions. [2022-02-21 03:36:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2022-02-21 03:36:01,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:01,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:01,761 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:01,761 INFO L87 Difference]: Start difference. First operand 60 states and 77 transitions. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:01,762 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:01,767 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-02-21 03:36:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-02-21 03:36:01,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:01,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:01,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) Second operand 60 states and 77 transitions. [2022-02-21 03:36:01,768 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) Second operand 60 states and 77 transitions. [2022-02-21 03:36:01,769 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:01,773 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-02-21 03:36:01,773 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-02-21 03:36:01,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:01,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:01,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:01,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (10), 3 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-21 03:36:01,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-02-21 03:36:01,783 INFO L704 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-02-21 03:36:01,783 INFO L587 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-02-21 03:36:01,783 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:01,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2022-02-21 03:36:01,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,784 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:01,784 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:01,786 INFO L791 eck$LassoCheckResult]: Stem: 1570#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1571#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; 1579#L31-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1580#L31-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 1611#L35 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1598#L39 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 1610#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1604#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 1574#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1602#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1586#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 1587#recFINAL assume true; 1601#recEXIT >#42#return; 1600#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 1599#recFINAL assume true; 1597#recEXIT >#44#return; 1578#L39-1 assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; 1568#L39-3 call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; 1569#L31-3 call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1582#L31-1 assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); 1594#L35 assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); 1584#L39 call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset);< 1588#recENTRY [2022-02-21 03:36:01,786 INFO L793 eck$LassoCheckResult]: Loop: 1588#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 1583#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 1585#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1588#recENTRY [2022-02-21 03:36:01,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2022-02-21 03:36:01,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758642711] [2022-02-21 03:36:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,857 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,880 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:01,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2022-02-21 03:36:01,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455405877] [2022-02-21 03:36:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,893 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2022-02-21 03:36:01,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133749259] [2022-02-21 03:36:01,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,955 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:24,833 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:24,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:24,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:24,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:24,833 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:24,833 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:24,833 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:24,833 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:24,833 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C.i_Iteration5_Lasso [2022-02-21 03:36:24,833 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:24,833 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:24,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:24,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,298 WARN L259 bleTransFormulaUtils]: 8 quantified variables [2022-02-21 03:36:25,300 WARN L259 bleTransFormulaUtils]: 7 quantified variables [2022-02-21 03:36:25,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,313 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:25,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,364 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:26,365 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:26,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,366 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 03:36:26,367 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 03:36:26,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:36:26,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,430 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 03:36:26,431 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 03:36:26,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:36:26,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,456 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 03:36:26,457 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 03:36:26,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-02-21 03:36:26,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,482 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 03:36:26,485 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 03:36:26,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:26,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:26,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,510 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 03:36:26,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,511 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 03:36:26,512 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 03:36:26,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,536 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 03:36:26,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,537 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 03:36:26,538 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 03:36:26,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,561 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 03:36:26,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,563 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 03:36:26,563 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 03:36:26,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,587 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 03:36:26,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,588 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 03:36:26,596 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 03:36:26,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,620 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 03:36:26,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,621 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 03:36:26,622 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 03:36:26,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,630 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,646 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 03:36:26,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,648 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 03:36:26,649 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 03:36:26,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-02-21 03:36:26,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,674 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 03:36:26,675 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 03:36:26,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-02-21 03:36:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,701 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 03:36:26,702 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 03:36:26,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:26,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:26,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:36:26,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,729 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 03:36:26,729 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 03:36:26,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,752 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 03:36:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,754 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 03:36:26,754 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 03:36:26,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:36:26,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,780 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 03:36:26,780 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 03:36:26,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,811 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 03:36:26,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,812 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 03:36:26,813 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 03:36:26,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-02-21 03:36:26,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,838 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 03:36:26,840 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 03:36:26,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,847 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,863 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 03:36:26,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,864 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 03:36:26,865 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 03:36:26,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,874 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:26,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,890 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 03:36:26,891 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 03:36:26,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,914 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 03:36:26,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,915 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 03:36:26,916 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 03:36:26,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,924 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,925 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,940 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 03:36:26,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,942 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 03:36:26,942 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 03:36:26,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:26,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:26,957 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,972 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 03:36:26,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,973 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 03:36:26,974 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 03:36:27,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,030 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,030 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,034 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,050 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 03:36:27,051 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 03:36:27,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,060 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,077 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 03:36:27,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,078 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 03:36:27,079 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 03:36:27,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,114 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 03:36:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,115 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 03:36:27,116 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 03:36:27,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,184 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 03:36:27,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,185 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 03:36:27,186 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 03:36:27,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,214 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 03:36:27,214 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 03:36:27,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,235 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:27,248 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-02-21 03:36:27,248 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:36:27,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,249 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 03:36:27,254 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:27,261 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:27,261 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:27,261 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2022-02-21 03:36:27,277 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 03:36:27,287 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:36:27,290 INFO L390 LassoCheck]: Loop: "~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4;" "call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);"< [2022-02-21 03:36:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:27,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2006#unseeded} is VALID [2022-02-21 03:36:27,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {2006#unseeded} is VALID [2022-02-21 03:36:27,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:27,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {2006#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:27,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {2006#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:27,620 INFO L272 TraceCheckUtils]: 5: Hoare triple {2006#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,623 INFO L272 TraceCheckUtils]: 8: Hoare triple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,633 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:27,635 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2049#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2006#unseeded} #44#return; {2006#unseeded} is VALID [2022-02-21 03:36:27,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {2006#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {2006#unseeded} is VALID [2022-02-21 03:36:27,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {2006#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {2006#unseeded} is VALID [2022-02-21 03:36:27,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {2006#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:27,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {2006#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:27,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {2006#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:27,649 INFO L272 TraceCheckUtils]: 21: Hoare triple {2006#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2006#unseeded} is VALID [2022-02-21 03:36:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:27,856 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:27,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:27,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {2009#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2098#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:27,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {2098#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2102#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:27,967 INFO L272 TraceCheckUtils]: 2: Hoare triple {2102#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2029#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:27,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:27,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:27,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:27,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:27,988 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 03:36:27,988 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:28,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:28,183 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 55 states and 65 transitions. Complement of second has 14 states. [2022-02-21 03:36:28,183 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 03:36:28,184 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:28,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:28,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:28,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:28,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 65 transitions. [2022-02-21 03:36:28,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:28,187 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,187 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,189 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:28,189 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:28,190 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:28,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:28,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:28,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 65 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:28,192 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:28,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:28,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:28,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:28,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:28,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:28,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:28,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,206 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:28,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:36:28,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,216 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:28,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2006#unseeded} is VALID [2022-02-21 03:36:28,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {2006#unseeded} is VALID [2022-02-21 03:36:28,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:28,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {2006#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:28,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {2006#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:28,510 INFO L272 TraceCheckUtils]: 5: Hoare triple {2006#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,511 INFO L290 TraceCheckUtils]: 6: Hoare triple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,516 INFO L272 TraceCheckUtils]: 8: Hoare triple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,519 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:28,521 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2200#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2006#unseeded} #44#return; {2006#unseeded} is VALID [2022-02-21 03:36:28,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {2006#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {2006#unseeded} is VALID [2022-02-21 03:36:28,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {2006#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {2006#unseeded} is VALID [2022-02-21 03:36:28,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {2006#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:28,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {2006#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:28,522 INFO L290 TraceCheckUtils]: 20: Hoare triple {2006#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:28,523 INFO L272 TraceCheckUtils]: 21: Hoare triple {2006#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2006#unseeded} is VALID [2022-02-21 03:36:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:28,699 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:28,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:28,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {2009#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2249#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:28,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {2249#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2253#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:28,805 INFO L272 TraceCheckUtils]: 2: Hoare triple {2253#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2029#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:28,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:28,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:28,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,833 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:36:28,833 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:28,986 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 55 states and 65 transitions. Complement of second has 14 states. [2022-02-21 03:36:28,986 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 03:36:28,987 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:28,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:28,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:28,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:28,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 65 transitions. [2022-02-21 03:36:28,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:28,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,989 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:28,989 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:28,989 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:28,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:28,990 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:28,990 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 65 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:28,990 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:28,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:28,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:28,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:36:28,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:28,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:28,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:28,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:28,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:28,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:28,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:28,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:29,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:29,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:29,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:29,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 65 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:29,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,001 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:29,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:29,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-02-21 03:36:29,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,002 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:29,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {2006#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2006#unseeded} is VALID [2022-02-21 03:36:29,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {2006#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~nondet7#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~mem14#1, main_#t~ret12#1, main_#t~ite13#1, main_~pp~0#1.base, main_~pp~0#1.offset, main_#t~mem8#1, main_~qq~0#1.base, main_~qq~0#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(4);main_~qq~0#1.base, main_~qq~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;call write~int(main_#t~nondet7#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~nondet7#1; {2006#unseeded} is VALID [2022-02-21 03:36:29,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {2006#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:29,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {2006#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:29,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {2006#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:29,326 INFO L272 TraceCheckUtils]: 5: Hoare triple {2006#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,328 INFO L272 TraceCheckUtils]: 8: Hoare triple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,330 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #42#return; {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:29,332 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2351#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2006#unseeded} #44#return; {2006#unseeded} is VALID [2022-02-21 03:36:29,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {2006#unseeded} assume -1 == main_#t~ret12#1;main_#t~ite13#1 := -1; {2006#unseeded} is VALID [2022-02-21 03:36:29,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {2006#unseeded} call write~int(main_#t~mem14#1 + main_#t~ite13#1, main_~qq~0#1.base, main_~qq~0#1.offset, 4);havoc main_#t~mem14#1;havoc main_#t~ret12#1;havoc main_#t~ite13#1; {2006#unseeded} is VALID [2022-02-21 03:36:29,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {2006#unseeded} call main_#t~mem8#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:29,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {2006#unseeded} assume !!(main_#t~mem8#1 > 1);havoc main_#t~mem8#1;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnHeap(4);main_~pp~0#1.base, main_~pp~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int(main_#t~nondet10#1, main_~pp~0#1.base, main_~pp~0#1.offset, 4);havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~pp~0#1.base, main_~pp~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:29,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {2006#unseeded} assume !(main_#t~mem11#1 < 0);havoc main_#t~mem11#1;call main_#t~mem14#1 := read~int(main_~qq~0#1.base, main_~qq~0#1.offset, 4); {2006#unseeded} is VALID [2022-02-21 03:36:29,334 INFO L272 TraceCheckUtils]: 21: Hoare triple {2006#unseeded} call main_#t~ret12#1 := rec(main_~pp~0#1.base, main_~pp~0#1.offset); {2006#unseeded} is VALID [2022-02-21 03:36:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:29,513 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:36:29,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-02-21 03:36:29,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {2009#(>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))} ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); {2400#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} is VALID [2022-02-21 03:36:29,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {2400#(and (<= (+ (* (select (select |#memory_int| rec_~op.base) rec_~op.offset) 2) 1) oldRank0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~op.base) rec_~op.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; {2404#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} is VALID [2022-02-21 03:36:29,659 INFO L272 TraceCheckUtils]: 2: Hoare triple {2404#(and (<= 0 rec_~ip~0.offset) (<= (+ (select (select |#memory_int| rec_~ip~0.base) rec_~ip~0.offset) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)) (<= rec_~ip~0.offset 0))} call #t~ret5 := rec(~ip~0.base, ~ip~0.offset); {2029#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~op.base|) |rec_#in~op.offset|)) 1))) unseeded)} is VALID [2022-02-21 03:36:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:29,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:29,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:29,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,688 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:36:29,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:29,898 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 68 states and 78 transitions. Complement of second has 15 states. [2022-02-21 03:36:29,898 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 03:36:29,899 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:29,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:29,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:29,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:29,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:29,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:29,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:29,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:29,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. [2022-02-21 03:36:29,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:29,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:29,901 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 54 transitions. cyclomatic complexity: 13 [2022-02-21 03:36:29,901 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:29,901 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:29,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:29,902 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:29,902 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:29,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:29,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:29,903 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:29,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:29,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:29,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:29,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:29,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:29,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 68 letters. Loop has 68 letters. [2022-02-21 03:36:29,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:29,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:29,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 45 letters. Loop has 45 letters. [2022-02-21 03:36:29,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:29,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:29,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:29,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:29,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:29,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:29,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 54 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:29,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:29,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 68 states and 78 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:36:29,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,910 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-02-21 03:36:29,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:29,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:29,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2022-02-21 03:36:29,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:29,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. cyclomatic complexity: 14 [2022-02-21 03:36:29,914 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:29,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2022-02-21 03:36:29,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:29,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:29,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:29,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:29,915 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:29,915 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:29,915 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:29,915 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:29,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:36:29,916 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:29,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:29,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:36:29 BoogieIcfgContainer [2022-02-21 03:36:29,921 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:36:29,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:36:29,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:36:29,922 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:36:29,922 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:44" (3/4) ... [2022-02-21 03:36:29,925 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:36:29,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:36:29,926 INFO L158 Benchmark]: Toolchain (without parser) took 46194.33ms. Allocated memory was 81.8MB in the beginning and 188.7MB in the end (delta: 107.0MB). Free memory was 52.9MB in the beginning and 105.4MB in the end (delta: -52.5MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2022-02-21 03:36:29,926 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 81.8MB. Free memory was 44.7MB in the beginning and 44.6MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:29,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.26ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 52.7MB in the beginning and 80.7MB in the end (delta: -28.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-02-21 03:36:29,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.26ms. Allocated memory is still 107.0MB. Free memory was 80.7MB in the beginning and 79.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:29,927 INFO L158 Benchmark]: Boogie Preprocessor took 17.61ms. Allocated memory is still 107.0MB. Free memory was 79.1MB in the beginning and 77.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:29,927 INFO L158 Benchmark]: RCFGBuilder took 361.07ms. Allocated memory is still 107.0MB. Free memory was 77.8MB in the beginning and 64.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:36:29,927 INFO L158 Benchmark]: BuchiAutomizer took 45565.79ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 64.5MB in the beginning and 106.5MB in the end (delta: -42.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2022-02-21 03:36:29,928 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 188.7MB. Free memory was 106.5MB in the beginning and 105.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:29,929 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.20ms. Allocated memory is still 81.8MB. Free memory was 44.7MB in the beginning and 44.6MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.26ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 52.7MB in the beginning and 80.7MB in the end (delta: -28.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.26ms. Allocated memory is still 107.0MB. Free memory was 80.7MB in the beginning and 79.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.61ms. Allocated memory is still 107.0MB. Free memory was 79.1MB in the beginning and 77.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.07ms. Allocated memory is still 107.0MB. Free memory was 77.8MB in the beginning and 64.5MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 45565.79ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 64.5MB in the beginning and 106.5MB in the end (delta: -42.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 188.7MB. Free memory was 106.5MB in the beginning and 105.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * \old(unknown-#memory_int-unknown)[op][op] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 45.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 40.2s. Construction of modules took 0.5s. Büchi inclusion checks took 4.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 24 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 307 IncrementalHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 80 mSDtfsCounter, 307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf100 lsp98 ukn38 mio100 lsp29 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf409 smp77 tf100 neg84 sie160 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:36:29,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:30,342 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forcibly destroying the process [2022-02-21 03:36:30,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE