./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.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_ex3.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 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:46,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:46,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:46,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:46,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:46,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:46,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:46,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:46,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:46,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:46,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:46,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:46,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:46,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:46,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:46,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:46,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:46,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:46,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:46,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:46,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:46,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:46,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:46,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:46,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:46,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:46,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:46,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:46,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:46,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:46,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:46,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:46,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:46,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:46,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:46,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:46,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:46,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:46,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:46,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:46,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:46,392 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:46,418 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:46,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:46,419 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:46,419 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:46,420 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:46,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:46,420 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:46,421 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:46,421 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:46,421 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:46,421 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:46,422 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:46,422 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:46,422 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:46,422 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:46,422 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:46,422 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:46,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:46,423 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:46,423 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:46,423 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:46,423 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:46,423 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:46,423 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:46,424 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:46,424 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:46,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:46,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:46,425 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:46,425 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 -> 33d006375056e7e3c58d58b776bed0fedce081ec4ff9e691f038a741177fe7dd [2022-02-21 03:35:46,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:46,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:46,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:46,631 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:46,631 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:46,632 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2022-02-21 03:35:46,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79404b4c/759b715b53154fdda282f1fb684b7368/FLAGf5391c9e2 [2022-02-21 03:35:47,078 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:47,078 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex3.i [2022-02-21 03:35:47,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79404b4c/759b715b53154fdda282f1fb684b7368/FLAGf5391c9e2 [2022-02-21 03:35:47,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f79404b4c/759b715b53154fdda282f1fb684b7368 [2022-02-21 03:35:47,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:47,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:47,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:47,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:47,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:47,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:47" (1/1) ... [2022-02-21 03:35:47,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15870503 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:47, skipping insertion in model container [2022-02-21 03:35:47,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:47" (1/1) ... [2022-02-21 03:35:47,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:47,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:47,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:47,311 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:47,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:47,331 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:47,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:47 WrapperNode [2022-02-21 03:35:47,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:47,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:47,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:47,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:47,338 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:47" (1/1) ... [2022-02-21 03:35:47,345 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:47" (1/1) ... [2022-02-21 03:35:47,357 INFO L137 Inliner]: procedures = 11, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-02-21 03:35:47,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:47,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:47,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:47,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:47,364 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:47" (1/1) ... [2022-02-21 03:35:47,364 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:47" (1/1) ... [2022-02-21 03:35:47,371 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:47" (1/1) ... [2022-02-21 03:35:47,371 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:47" (1/1) ... [2022-02-21 03:35:47,395 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:47" (1/1) ... [2022-02-21 03:35:47,398 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:47" (1/1) ... [2022-02-21 03:35:47,401 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:47" (1/1) ... [2022-02-21 03:35:47,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:47,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:47,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:47,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:47,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:47" (1/1) ... [2022-02-21 03:35:47,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:47,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:47,431 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:47,467 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:47,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-02-21 03:35:47,485 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-02-21 03:35:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:47,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:47,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:47,525 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:47,526 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:47,688 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:47,697 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:47,697 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:35:47,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:47 BoogieIcfgContainer [2022-02-21 03:35:47,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:47,699 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:47,700 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:47,702 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:47,702 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:47,702 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:47" (1/3) ... [2022-02-21 03:35:47,703 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aee4f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:47, skipping insertion in model container [2022-02-21 03:35:47,703 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:47,703 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:47" (2/3) ... [2022-02-21 03:35:47,704 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2aee4f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:47, skipping insertion in model container [2022-02-21 03:35:47,704 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:47,704 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:47" (3/3) ... [2022-02-21 03:35:47,705 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex3.i [2022-02-21 03:35:47,732 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:47,732 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:47,732 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:47,732 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:47,732 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:47,732 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:47,732 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:47,733 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:47,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:47,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:35:47,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:47,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:47,762 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:47,762 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:47,762 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:47,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:47,765 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:35:47,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:47,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:47,766 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:47,766 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:47,770 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 10#L20-2true [2022-02-21 03:35:47,771 INFO L793 eck$LassoCheckResult]: Loop: 10#L20-2true assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 12#L23true call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 11#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 9#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 14#recFINALtrue assume true; 13#recEXITtrue >#30#return; 7#L23-1true main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; 10#L20-2true [2022-02-21 03:35:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:47,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2022-02-21 03:35:47,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:47,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981114719] [2022-02-21 03:35:47,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,860 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2039113776, now seen corresponding path program 1 times [2022-02-21 03:35:47,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:47,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600527967] [2022-02-21 03:35:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,940 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,980 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1009969970, now seen corresponding path program 1 times [2022-02-21 03:35:47,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:47,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107005544] [2022-02-21 03:35:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:48,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:48,058 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:48,650 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:48,650 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:48,651 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:48,651 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:48,651 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:48,651 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,651 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:48,651 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:48,651 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration1_Lasso [2022-02-21 03:35:48,651 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:48,651 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:48,661 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,666 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,668 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,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:48,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:48,727 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,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:48,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:48,876 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:48,879 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:48,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:48,881 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,882 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,883 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,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:48,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:48,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:48,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:48,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:48,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:48,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:48,927 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,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:48,929 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,938 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,940 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,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:48,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:48,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:48,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:48,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:48,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:48,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:48,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:48,978 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,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:48,980 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,981 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,982 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,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:48,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:48,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:48,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:48,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:48,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:48,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:48,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:48,995 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:35:48,995 INFO L444 ModelExtractionUtils]: 3 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:35:48,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:48,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:49,008 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:49,009 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:49,052 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:49,052 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:35:49,052 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:49,052 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:35:49,068 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:49,094 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:35:49,099 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#30#return;" "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1;" [2022-02-21 03:35:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:35:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:49,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {24#unseeded} is VALID [2022-02-21 03:35:49,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {24#unseeded} is VALID [2022-02-21 03:35:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:35:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:49,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:49,419 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 15 treesize of output 7 [2022-02-21 03:35:49,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {45#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:35:49,514 INFO L272 TraceCheckUtils]: 1: Hoare triple {45#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {49#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:49,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {49#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {53#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:35:49,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {53#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {57#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:35:49,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {57#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {57#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:35:49,518 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {57#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} {45#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} #30#return; {64#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_#t~ret9#1| 0) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:35:49,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {64#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_#t~ret9#1| 0) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {37#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:35:49,519 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:49,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:49,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:49,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:35:49,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,559 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:49,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:49,744 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:49,755 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Result 63 states and 77 transitions. Complement of second has 22 states. [2022-02-21 03:35:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:49,755 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:49,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:49,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:35:49,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:49,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:49,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:49,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:49,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:49,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:49,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 77 transitions. [2022-02-21 03:35:49,765 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:49,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:49,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:49,766 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:49,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:35:49,769 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:35:49,769 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:49,770 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:35:49,771 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:35:49,771 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 77 transitions. cyclomatic complexity: 19 [2022-02-21 03:35:49,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:35:49,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 7 letters. [2022-02-21 03:35:49,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:35:49,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:35:49,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 6 letters. [2022-02-21 03:35:49,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:49,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:49,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:49,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:49,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:49,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 63 letters. Loop has 63 letters. [2022-02-21 03:35:49,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:35:49,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 63 letters. Loop has 63 letters. [2022-02-21 03:35:49,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 14 letters. Loop has 14 letters. [2022-02-21 03:35:49,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:35:49,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:35:49,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 9 letters. [2022-02-21 03:35:49,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:35:49,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:35:49,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:49,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:35:49,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:35:49,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:49,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:49,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:35:49,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:49,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:35:49,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:35:49,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 7 letters. [2022-02-21 03:35:49,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 3 letters. Loop has 7 letters. [2022-02-21 03:35:49,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 7 letters. [2022-02-21 03:35:49,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 7 letters. [2022-02-21 03:35:49,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:35:49,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:35:49,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 7 letters. [2022-02-21 03:35:49,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:35:49,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:35:49,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 7 letters. [2022-02-21 03:35:49,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:35:49,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:35:49,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 1 letters. [2022-02-21 03:35:49,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:49,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:35:49,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 6 letters. [2022-02-21 03:35:49,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:49,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:35:49,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:49,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:49,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:49,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:49,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:49,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:49,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:49,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 3 letters. [2022-02-21 03:35:49,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:49,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:49,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 7 letters. [2022-02-21 03:35:49,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:49,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:49,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 7 letters. [2022-02-21 03:35:49,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:35:49,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:35:49,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 15 letters. Loop has 7 letters. [2022-02-21 03:35:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 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 7 letters. [2022-02-21 03:35:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:35:49,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 77 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:35:49,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,807 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:49,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 22 transitions. [2022-02-21 03:35:49,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 7 letters. [2022-02-21 03:35:49,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:35:49,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 22 transitions. Stem has 2 letters. Loop has 14 letters. [2022-02-21 03:35:49,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:49,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 77 transitions. cyclomatic complexity: 19 [2022-02-21 03:35:49,817 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:49,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 35 states and 42 transitions. [2022-02-21 03:35:49,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-02-21 03:35:49,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-02-21 03:35:49,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 42 transitions. [2022-02-21 03:35:49,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:49,823 INFO L681 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-02-21 03:35:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 42 transitions. [2022-02-21 03:35:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-02-21 03:35:49,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:49,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 42 transitions. Second operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:35:49,841 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 42 transitions. Second operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:35:49,843 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:35:49,844 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:49,849 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-02-21 03:35:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-02-21 03:35:49,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:49,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:49,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 35 states and 42 transitions. [2022-02-21 03:35:49,850 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 35 states and 42 transitions. [2022-02-21 03:35:49,850 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:49,867 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-02-21 03:35:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-02-21 03:35:49,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:49,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:49,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:49,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:35:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-21 03:35:49,871 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-21 03:35:49,871 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-21 03:35:49,871 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:49,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2022-02-21 03:35:49,872 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:49,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:49,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:49,872 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:49,872 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:49,872 INFO L791 eck$LassoCheckResult]: Stem: 160#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 184#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 163#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 178#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 162#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 164#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 174#recENTRY [2022-02-21 03:35:49,872 INFO L793 eck$LassoCheckResult]: Loop: 174#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 176#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 175#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 174#recENTRY [2022-02-21 03:35:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:49,873 INFO L85 PathProgramCache]: Analyzing trace with hash 557607690, now seen corresponding path program 1 times [2022-02-21 03:35:49,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:49,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307119512] [2022-02-21 03:35:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:49,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:49,901 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:49,913 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:49,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:49,913 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 1 times [2022-02-21 03:35:49,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:49,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041339575] [2022-02-21 03:35:49,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:49,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:49,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:49,924 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:49,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:49,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1242807987, now seen corresponding path program 2 times [2022-02-21 03:35:49,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:49,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71211961] [2022-02-21 03:35:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:49,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:49,946 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:49,967 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:50,902 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:50,902 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:50,902 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:50,902 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:50,902 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:50,902 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:50,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:50,902 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:50,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration2_Lasso [2022-02-21 03:35:50,902 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:50,902 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:50,904 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:51,090 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:51,091 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:51,093 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:51,095 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:51,097 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:51,100 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:51,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:51,103 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:51,105 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:51,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:51,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:51,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:51,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:51,116 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:51,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:51,120 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:51,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:51,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:51,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:51,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:51,128 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:51,130 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:51,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:51,134 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:51,136 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:51,139 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:51,464 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:51,465 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:51,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:51,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:51,466 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:51,467 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:51,469 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:51,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:51,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:51,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:51,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:51,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:51,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:51,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:51,518 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:51,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:51,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:51,520 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:51,521 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:51,522 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:51,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:51,528 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:35:51,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:51,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:51,535 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-02-21 03:35:51,535 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:51,552 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:51,567 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:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:51,568 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:51,569 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:51,570 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:51,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:51,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:51,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:51,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:51,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:51,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:51,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:51,616 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:51,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:51,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:51,618 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:51,620 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:51,620 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:51,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:51,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:51,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:51,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:51,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:51,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:51,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:51,660 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:35:51,660 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 03:35:51,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:51,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:51,662 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:51,663 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:51,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:51,685 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:51,685 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:51,685 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) 0)_1 + 1 Supporting invariants [] [2022-02-21 03:35:51,717 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:51,727 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:35:51,732 INFO L390 LassoCheck]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< [2022-02-21 03:35:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:35:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:51,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {396#unseeded} is VALID [2022-02-21 03:35:51,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {396#unseeded} is VALID [2022-02-21 03:35:51,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {396#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {435#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) unseeded (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} is VALID [2022-02-21 03:35:51,854 INFO L272 TraceCheckUtils]: 3: Hoare triple {435#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) unseeded (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {420#(and unseeded (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:35:51,854 INFO L290 TraceCheckUtils]: 4: Hoare triple {420#(and unseeded (= |rec_#in~p.offset| 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {442#(and (= rec_~p.offset 0) unseeded)} is VALID [2022-02-21 03:35:51,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {442#(and (= rec_~p.offset 0) unseeded)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {442#(and (= rec_~p.offset 0) unseeded)} is VALID [2022-02-21 03:35:51,855 INFO L272 TraceCheckUtils]: 6: Hoare triple {442#(and (= rec_~p.offset 0) unseeded)} call #t~ret5 := rec(~p.base, ~p.offset); {420#(and unseeded (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:35:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:35:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:51,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:51,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:35:51,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 39 treesize of output 33 [2022-02-21 03:35:52,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#(and (>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) 0)) 1)) (= |rec_#in~p.offset| 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {449#(and (= rec_~p.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) 0)) 1) oldRank0))} is VALID [2022-02-21 03:35:52,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#(and (= rec_~p.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) 0)) 1) oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {453#(and (= rec_~p.offset 0) (<= (+ (select (select |#memory_int| rec_~p.base) 0) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)))} is VALID [2022-02-21 03:35:52,022 INFO L272 TraceCheckUtils]: 2: Hoare triple {453#(and (= rec_~p.offset 0) (<= (+ (select (select |#memory_int| rec_~p.base) 0) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)))} call #t~ret5 := rec(~p.base, ~p.offset); {423#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) 0)) 1))) unseeded) (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:35:52,022 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:52,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:52,034 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:52,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 letters. Loop has 3 letters. [2022-02-21 03:35:52,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,035 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2022-02-21 03:35:52,035 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10 Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:52,168 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:52,227 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 10. Second operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 47 states and 56 transitions. Complement of second has 19 states. [2022-02-21 03:35:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:52,227 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:52,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. cyclomatic complexity: 10 [2022-02-21 03:35:52,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:52,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:52,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:52,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:52,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:52,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:52,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 56 transitions. [2022-02-21 03:35:52,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:35:52,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:52,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:52,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 38 transitions. cyclomatic complexity: 10 [2022-02-21 03:35:52,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:35:52,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:52,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:52,233 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:52,234 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 56 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:52,235 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:35:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:52,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 letters. Loop has 3 letters. [2022-02-21 03:35:52,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:52,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:35:52,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 4 letters. Loop has 3 letters. [2022-02-21 03:35:52,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:35:52,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:35:52,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 47 letters. Loop has 47 letters. [2022-02-21 03:35:52,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:35:52,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:35:52,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 32 letters. [2022-02-21 03:35:52,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:35:52,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:52,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 8 letters. Loop has 8 letters. [2022-02-21 03:35:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 8 letters. Loop has 3 letters. [2022-02-21 03:35:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:35:52,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 7 letters. Loop has 3 letters. [2022-02-21 03:35:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:52,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:52,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:35:52,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:52,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 3 letters. [2022-02-21 03:35:52,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 3 letters. [2022-02-21 03:35:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:52,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 3 letters. [2022-02-21 03:35:52,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:52,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:52,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 16 letters. Loop has 7 letters. [2022-02-21 03:35:52,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 15 letters. Loop has 7 letters. [2022-02-21 03:35:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:35:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 4 letters. Loop has 3 letters. [2022-02-21 03:35:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:35:52,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 3 letters. [2022-02-21 03:35:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:52,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 3 letters. [2022-02-21 03:35:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 3 letters. [2022-02-21 03:35:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:52,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:52,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 15 letters. Loop has 7 letters. [2022-02-21 03:35:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 16 letters. Loop has 7 letters. [2022-02-21 03:35:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:52,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 56 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:52,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,251 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2022-02-21 03:35:52,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:35:52,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:35:52,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:35:52,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:52,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. cyclomatic complexity: 13 [2022-02-21 03:35:52,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:35:52,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 50 transitions. [2022-02-21 03:35:52,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-02-21 03:35:52,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 03:35:52,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2022-02-21 03:35:52,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:52,257 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-02-21 03:35:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2022-02-21 03:35:52,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-02-21 03:35:52,260 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:52,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 50 transitions. Second operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:35:52,260 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 50 transitions. Second operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:35:52,260 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:35:52,260 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:52,263 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-02-21 03:35:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2022-02-21 03:35:52,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:52,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:52,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Second operand 41 states and 50 transitions. [2022-02-21 03:35:52,264 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Second operand 41 states and 50 transitions. [2022-02-21 03:35:52,264 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:52,267 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-02-21 03:35:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-02-21 03:35:52,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:52,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:52,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:52,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:35:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-02-21 03:35:52,270 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-02-21 03:35:52,270 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-02-21 03:35:52,270 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:52,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. [2022-02-21 03:35:52,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:35:52,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:52,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:52,276 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:52,276 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:52,276 INFO L791 eck$LassoCheckResult]: Stem: 534#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 535#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 556#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 544#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 564#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 565#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 540#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 548#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 549#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 572#recFINAL assume true; 570#recEXIT >#28#return; 569#L15-1 #res := #t~ret5;havoc #t~ret5; 568#recFINAL assume true; 560#recEXIT >#30#return; 557#L23-1 [2022-02-21 03:35:52,276 INFO L793 eck$LassoCheckResult]: Loop: 557#L23-1 main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; 541#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 542#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 551#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 561#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 563#recFINAL assume true; 566#recEXIT >#30#return; 557#L23-1 [2022-02-21 03:35:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1969157627, now seen corresponding path program 1 times [2022-02-21 03:35:52,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:52,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046875884] [2022-02-21 03:35:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,293 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,304 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:52,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:52,304 INFO L85 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 2 times [2022-02-21 03:35:52,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:52,305 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633706538] [2022-02-21 03:35:52,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:52,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,330 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:52,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash 931270558, now seen corresponding path program 1 times [2022-02-21 03:35:52,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:52,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597239504] [2022-02-21 03:35:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:52,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,359 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,380 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:53,404 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:53,405 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:53,405 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:53,405 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:53,405 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:53,405 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,405 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:53,405 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:53,405 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration3_Lasso [2022-02-21 03:35:53,405 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:53,405 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:53,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:53,410 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:53,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:35:53,413 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:53,415 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:53,417 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:53,418 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:53,509 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:53,510 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:35:53,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:53,681 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:53,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,683 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:53,683 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:53,684 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:53,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:53,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:53,701 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,716 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:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,718 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:53,719 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:53,720 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:53,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:53,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:53,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:53,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,742 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:53,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,743 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:53,744 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:53,746 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:53,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:53,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:53,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:53,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:35:53,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,769 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:53,769 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:53,772 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:53,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:53,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:53,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:53,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,798 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:53,798 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:53,800 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:53,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:53,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:53,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:53,806 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:35:53,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,824 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:53,825 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:53,826 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:53,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:53,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:53,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:53,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,848 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:53,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,849 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:53,850 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:53,852 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:53,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,858 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:53,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:53,861 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,885 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:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,887 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:53,888 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:53,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:53,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:53,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:53,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,913 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:53,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,914 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:53,915 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:53,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:35:53,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:53,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:53,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:53,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:53,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,950 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:53,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:53,951 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:53,955 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:53,955 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:53,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:53,961 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:35:53,961 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:35:53,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:53,965 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-02-21 03:35:53,965 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:35:53,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:53,997 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:53,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:53,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:54,006 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:54,008 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:54,009 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:54,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:54,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:54,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:54,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:54,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:54,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:54,029 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:54,040 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2022-02-21 03:35:54,040 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-02-21 03:35:54,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:54,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:54,042 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:54,042 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:54,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:54,049 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:54,050 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:54,050 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~ret9#1) = 1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_#t~ret9#1 Supporting invariants [] [2022-02-21 03:35:54,065 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:54,072 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:35:54,075 INFO L390 LassoCheck]: Loop: "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1;" "assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#30#return;" [2022-02-21 03:35:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:54,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:35:54,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:54,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:54,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {799#unseeded} is VALID [2022-02-21 03:35:54,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {799#unseeded} is VALID [2022-02-21 03:35:54,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {799#unseeded} is VALID [2022-02-21 03:35:54,248 INFO L272 TraceCheckUtils]: 3: Hoare triple {799#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:54,254 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {831#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {799#unseeded} #30#return; {799#unseeded} is VALID [2022-02-21 03:35:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:54,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:35:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:54,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:54,400 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 15 treesize of output 7 [2022-02-21 03:35:54,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {802#(>= oldRank0 (+ |ULTIMATE.start_main_#t~ret9#1| |ULTIMATE.start_main_~i~0#1|))} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {862#(<= |ULTIMATE.start_main_~i~0#1| oldRank0)} is VALID [2022-02-21 03:35:54,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {862#(<= |ULTIMATE.start_main_~i~0#1| oldRank0)} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {866#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:35:54,427 INFO L272 TraceCheckUtils]: 2: Hoare triple {866#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {870#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:35:54,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {870#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {874#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:35:54,428 INFO L290 TraceCheckUtils]: 4: Hoare triple {874#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {878#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:35:54,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {878#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {878#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:35:54,429 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {878#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} {866#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} #30#return; {817#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_#t~ret9#1| |ULTIMATE.start_main_~i~0#1|))) unseeded)} is VALID [2022-02-21 03:35:54,429 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:54,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:54,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:54,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,452 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 03:35:54,452 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11 Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:54,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 46 transitions. cyclomatic complexity: 11. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Result 130 states and 152 transitions. Complement of second has 21 states. [2022-02-21 03:35:54,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:35:54,634 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:54,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 46 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:54,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:54,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:54,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:54,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:54,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:54,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:54,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 152 transitions. [2022-02-21 03:35:54,637 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:54,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:54,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:54,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 39 states and 46 transitions. cyclomatic complexity: 11 [2022-02-21 03:35:54,639 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:35:54,639 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:54,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:35:54,640 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:35:54,640 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 130 states and 152 transitions. cyclomatic complexity: 31 [2022-02-21 03:35:54,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:35:54,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:35:54,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:35:54,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:35:54,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:35:54,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:35:54,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:35:54,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 130 letters. Loop has 130 letters. [2022-02-21 03:35:54,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 130 letters. Loop has 130 letters. [2022-02-21 03:35:54,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 130 letters. Loop has 130 letters. [2022-02-21 03:35:54,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:35:54,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:35:54,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 39 letters. Loop has 39 letters. [2022-02-21 03:35:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:35:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:54,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:54,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:35:54,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:54,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:54,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:35:54,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:54,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:54,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:35:54,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:35:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:54,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:35:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:35:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:35:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:35:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:54,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:35:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:35:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:35:54,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:35:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:35:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:35:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:35:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:35:54,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:35:54,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:35:54,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:35:54,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:35:54,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:35:54,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:35:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:35:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:35:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:35:54,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:35:54,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:35:54,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:54,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:54,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:35:54,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:35:54,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:35:54,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:35:54,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 39 states and 46 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:35:54,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:35:54,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 130 states and 152 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:35:54,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,668 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:35:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:35:54,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2022-02-21 03:35:54,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:35:54,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:35:54,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:35:54,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:35:54,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 152 transitions. cyclomatic complexity: 31 [2022-02-21 03:35:54,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:54,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 90 states and 105 transitions. [2022-02-21 03:35:54,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-02-21 03:35:54,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-02-21 03:35:54,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 105 transitions. [2022-02-21 03:35:54,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:35:54,680 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 105 transitions. [2022-02-21 03:35:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 105 transitions. [2022-02-21 03:35:54,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2022-02-21 03:35:54,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:54,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states and 105 transitions. Second operand has 82 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2022-02-21 03:35:54,690 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states and 105 transitions. Second operand has 82 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2022-02-21 03:35:54,690 INFO L87 Difference]: Start difference. First operand 90 states and 105 transitions. Second operand has 82 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2022-02-21 03:35:54,691 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:54,702 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2022-02-21 03:35:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-02-21 03:35:54,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:54,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:54,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) Second operand 90 states and 105 transitions. [2022-02-21 03:35:54,703 INFO L87 Difference]: Start difference. First operand has 82 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) Second operand 90 states and 105 transitions. [2022-02-21 03:35:54,703 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:35:54,707 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2022-02-21 03:35:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions. [2022-02-21 03:35:54,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:54,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:54,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:54,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2022-02-21 03:35:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2022-02-21 03:35:54,710 INFO L704 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2022-02-21 03:35:54,710 INFO L587 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2022-02-21 03:35:54,710 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:35:54,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2022-02-21 03:35:54,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:35:54,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:54,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:54,711 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:54,711 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:35:54,712 INFO L791 eck$LassoCheckResult]: Stem: 1044#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1045#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 1072#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 1082#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 1083#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1088#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 1078#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1087#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1095#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 1097#recFINAL assume true; 1086#recEXIT >#28#return; 1085#L15-1 #res := #t~ret5;havoc #t~ret5; 1084#recFINAL assume true; 1081#recEXIT >#30#return; 1080#L23-1 main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; 1056#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 1057#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 1059#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1060#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 1054#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1075#recENTRY [2022-02-21 03:35:54,712 INFO L793 eck$LassoCheckResult]: Loop: 1075#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 1122#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 1053#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 1075#recENTRY [2022-02-21 03:35:54,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -801242957, now seen corresponding path program 2 times [2022-02-21 03:35:54,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:54,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378269563] [2022-02-21 03:35:54,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:54,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:54,738 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:54,768 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:54,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash 29942, now seen corresponding path program 2 times [2022-02-21 03:35:54,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:54,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25284257] [2022-02-21 03:35:54,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:54,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:54,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:54,779 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1599299332, now seen corresponding path program 3 times [2022-02-21 03:35:54,779 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:54,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452726302] [2022-02-21 03:35:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:54,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:54,845 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:54,858 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:58,272 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:35:58,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:35:58,273 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:35:58,273 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:35:58,273 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:35:58,273 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:58,273 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:35:58,273 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:35:58,273 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration4_Lasso [2022-02-21 03:35:58,273 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:35:58,273 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:35:58,278 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:58,280 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:58,282 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:58,284 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:58,286 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:58,287 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:58,289 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:58,292 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:58,294 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:58,296 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:58,297 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:58,300 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:58,302 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:58,304 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:58,305 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:58,307 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:58,309 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:58,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:35:58,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:35:58,563 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:35:58,564 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:35:58,567 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:58,568 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:58,570 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:58,571 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:58,573 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:58,578 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:58,909 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:35:58,909 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:35:58,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:58,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:58,911 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:58,912 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:58,913 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:58,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:58,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:58,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:58,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:58,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:58,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:58,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:58,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:58,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:58,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:58,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:58,952 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:58,954 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:58,954 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:58,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:58,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:58,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:58,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:58,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:58,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:58,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:58,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:58,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:58,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:58,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:58,992 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:58,992 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:58,994 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:59,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:59,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:59,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,022 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:59,024 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:59,025 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:59,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,030 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,047 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:59,047 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:59,049 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:59,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,069 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:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,071 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:59,072 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:59,073 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:59,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,112 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:59,113 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:59,115 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:59,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,127 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,144 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:59,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,145 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:59,146 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:59,147 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:59,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,153 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,170 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:59,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,171 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:59,172 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:59,173 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:59,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,201 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:59,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,203 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:59,204 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:59,205 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:59,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,235 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:59,235 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:59,236 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:59,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,258 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:59,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,259 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:59,261 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:59,262 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:59,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,284 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:59,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,287 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:59,288 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:59,288 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:59,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,293 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:35:59,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,311 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:59,311 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:59,313 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:59,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:35:59,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,334 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:59,335 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:59,336 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:59,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,374 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:59,375 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:59,376 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:59,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:59,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:59,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,424 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:59,425 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:59,426 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:59,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:35:59,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:35:59,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:35:59,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,471 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:59,474 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:59,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,482 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:59,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:59,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:59,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-02-21 03:35:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,503 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:59,504 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:59,505 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:59,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:59,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:59,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,533 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:59,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,535 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:35:59,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:35:59,537 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:59,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:59,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:59,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,592 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:35:59,593 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:35:59,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:35:59,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:59,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:59,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,621 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:35:59,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,622 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:35:59,623 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:35:59,625 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:59,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,631 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:35:59,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,633 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-02-21 03:35:59,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:59,648 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:35:59,664 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:35:59,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,665 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:35:59,666 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:35:59,667 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:59,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:35:59,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:35:59,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:35:59,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:35:59,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:35:59,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:35:59,684 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:35:59,693 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:35:59,693 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:35:59,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:59,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:59,694 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:35:59,696 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:35:59,697 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:35:59,704 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:35:59,704 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:35:59,704 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) 0)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) 0)_2 + 1 Supporting invariants [] [2022-02-21 03:35:59,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:35:59,728 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-02-21 03:35:59,733 INFO L390 LassoCheck]: Loop: "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< [2022-02-21 03:35:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:59,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:59,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:35:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:59,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:59,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {1564#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1564#unseeded} is VALID [2022-02-21 03:35:59,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {1564#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1564#unseeded} is VALID [2022-02-21 03:35:59,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {1564#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {1564#unseeded} is VALID [2022-02-21 03:35:59,986 INFO L272 TraceCheckUtils]: 3: Hoare triple {1564#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,987 INFO L290 TraceCheckUtils]: 4: Hoare triple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,988 INFO L272 TraceCheckUtils]: 6: Hoare triple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:35:59,995 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1606#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1564#unseeded} #30#return; {1564#unseeded} is VALID [2022-02-21 03:35:59,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#unseeded} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {1564#unseeded} is VALID [2022-02-21 03:35:59,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {1643#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) unseeded (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} is VALID [2022-02-21 03:35:59,998 INFO L272 TraceCheckUtils]: 16: Hoare triple {1643#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) unseeded (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {1588#(and unseeded (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:35:59,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {1588#(and unseeded (= |rec_#in~p.offset| 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1650#(and (= rec_~p.offset 0) unseeded)} is VALID [2022-02-21 03:35:59,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {1650#(and (= rec_~p.offset 0) unseeded)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {1650#(and (= rec_~p.offset 0) unseeded)} is VALID [2022-02-21 03:35:59,999 INFO L272 TraceCheckUtils]: 19: Hoare triple {1650#(and (= rec_~p.offset 0) unseeded)} call #t~ret5 := rec(~p.base, ~p.offset); {1588#(and unseeded (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:36:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:00,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:00,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:00,135 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:36:00,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 39 treesize of output 33 [2022-02-21 03:36:00,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {1589#(and (>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) 0)) 1)) (= |rec_#in~p.offset| 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1657#(and (= rec_~p.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) 0)) 1) oldRank0))} is VALID [2022-02-21 03:36:00,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {1657#(and (= rec_~p.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) 0)) 1) oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {1661#(and (<= (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1) (div (+ (- 1) oldRank0) 2)) (= rec_~p.offset 0) (<= 0 (div (+ (- 1) oldRank0) 2)))} is VALID [2022-02-21 03:36:00,174 INFO L272 TraceCheckUtils]: 2: Hoare triple {1661#(and (<= (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1) (div (+ (- 1) oldRank0) 2)) (= rec_~p.offset 0) (<= 0 (div (+ (- 1) oldRank0) 2)))} call #t~ret5 := rec(~p.base, ~p.offset); {1591#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) 0)) 1))) unseeded) (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:36:00,174 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:00,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:00,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:00,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,196 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2022-02-21 03:36:00,196 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:00,404 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 106 states and 124 transitions. Complement of second has 19 states. [2022-02-21 03:36:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:00,404 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:00,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:00,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:00,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:00,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:00,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:00,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:00,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:00,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 124 transitions. [2022-02-21 03:36:00,406 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:36:00,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:00,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:00,406 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:00,407 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:36:00,408 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:00,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:00,409 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:00,409 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 106 states and 124 transitions. cyclomatic complexity: 25 [2022-02-21 03:36:00,409 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:36:00,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:00,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:00,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:00,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:00,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:00,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:00,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:00,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:00,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:00,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:00,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:00,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:00,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:00,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:00,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:00,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:00,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:00,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:00,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:00,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:00,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:00,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:00,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,433 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2022-02-21 03:36:00,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,434 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:00,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:00,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:36:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:00,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:00,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {1564#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1564#unseeded} is VALID [2022-02-21 03:36:00,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {1564#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1564#unseeded} is VALID [2022-02-21 03:36:00,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {1564#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {1564#unseeded} is VALID [2022-02-21 03:36:00,664 INFO L272 TraceCheckUtils]: 3: Hoare triple {1564#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,665 INFO L272 TraceCheckUtils]: 6: Hoare triple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:00,669 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1816#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1564#unseeded} #30#return; {1564#unseeded} is VALID [2022-02-21 03:36:00,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#unseeded} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {1564#unseeded} is VALID [2022-02-21 03:36:00,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {1853#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) unseeded (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} is VALID [2022-02-21 03:36:00,671 INFO L272 TraceCheckUtils]: 16: Hoare triple {1853#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) unseeded (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {1588#(and unseeded (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:36:00,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {1588#(and unseeded (= |rec_#in~p.offset| 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1860#(and (= rec_~p.offset 0) unseeded)} is VALID [2022-02-21 03:36:00,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {1860#(and (= rec_~p.offset 0) unseeded)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {1860#(and (= rec_~p.offset 0) unseeded)} is VALID [2022-02-21 03:36:00,672 INFO L272 TraceCheckUtils]: 19: Hoare triple {1860#(and (= rec_~p.offset 0) unseeded)} call #t~ret5 := rec(~p.base, ~p.offset); {1588#(and unseeded (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:36:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:00,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:00,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:00,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:36:00,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 39 treesize of output 33 [2022-02-21 03:36:00,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {1589#(and (>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) 0)) 1)) (= |rec_#in~p.offset| 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1867#(and (= rec_~p.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) 0)) 1) oldRank0))} is VALID [2022-02-21 03:36:00,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {1867#(and (= rec_~p.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) 0)) 1) oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {1871#(and (= rec_~p.offset 0) (<= (+ (select (select |#memory_int| rec_~p.base) 0) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)))} is VALID [2022-02-21 03:36:00,845 INFO L272 TraceCheckUtils]: 2: Hoare triple {1871#(and (= rec_~p.offset 0) (<= (+ (select (select |#memory_int| rec_~p.base) 0) 1) (div (+ (- 1) oldRank0) 2)) (<= 0 (div (+ (- 1) oldRank0) 2)))} call #t~ret5 := rec(~p.base, ~p.offset); {1591#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) 0)) 1))) unseeded) (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:36:00,845 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:00,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:00,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:00,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:00,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:00,868 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 3 loop predicates [2022-02-21 03:36:00,869 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 106 states and 124 transitions. Complement of second has 19 states. [2022-02-21 03:36:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:01,069 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:01,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:01,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 124 transitions. [2022-02-21 03:36:01,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:36:01,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,071 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:01,071 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:36:01,071 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,072 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:01,072 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 106 states and 124 transitions. cyclomatic complexity: 25 [2022-02-21 03:36:01,073 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:36:01,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:36:01,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:36:01,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 106 letters. Loop has 106 letters. [2022-02-21 03:36:01,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:01,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:01,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:01,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:01,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:36:01,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:01,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:01,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:01,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:01,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:01,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:01,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:01,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:01,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:01,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:01,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:01,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 106 states and 124 transitions. cyclomatic complexity: 25 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:01,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,103 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2022-02-21 03:36:01,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,107 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:01,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:36:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:01,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:01,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {1564#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1564#unseeded} is VALID [2022-02-21 03:36:01,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1564#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1564#unseeded} is VALID [2022-02-21 03:36:01,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {1564#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {1564#unseeded} is VALID [2022-02-21 03:36:01,345 INFO L272 TraceCheckUtils]: 3: Hoare triple {1564#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,346 INFO L290 TraceCheckUtils]: 4: Hoare triple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,350 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,350 INFO L290 TraceCheckUtils]: 11: Hoare triple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:01,351 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2026#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {1564#unseeded} #30#return; {1564#unseeded} is VALID [2022-02-21 03:36:01,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {1564#unseeded} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {1564#unseeded} is VALID [2022-02-21 03:36:01,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {1564#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {2063#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) unseeded (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} is VALID [2022-02-21 03:36:01,353 INFO L272 TraceCheckUtils]: 16: Hoare triple {2063#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) unseeded (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {1588#(and unseeded (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:36:01,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {1588#(and unseeded (= |rec_#in~p.offset| 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2070#(and (= rec_~p.offset 0) unseeded)} is VALID [2022-02-21 03:36:01,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {2070#(and (= rec_~p.offset 0) unseeded)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {2070#(and (= rec_~p.offset 0) unseeded)} is VALID [2022-02-21 03:36:01,356 INFO L272 TraceCheckUtils]: 19: Hoare triple {2070#(and (= rec_~p.offset 0) unseeded)} call #t~ret5 := rec(~p.base, ~p.offset); {1588#(and unseeded (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:36:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:01,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:36:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:01,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:01,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-21 03:36:01,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 39 treesize of output 33 [2022-02-21 03:36:01,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {1589#(and (>= oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) 0)) 1)) (= |rec_#in~p.offset| 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2077#(and (= rec_~p.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) 0)) 1) oldRank0))} is VALID [2022-02-21 03:36:01,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#(and (= rec_~p.offset 0) (<= |rec_#t~mem1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (+ (* 2 (select (select |#memory_int| rec_~p.base) 0)) 1) oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {2081#(and (<= (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1) (div (+ (- 1) oldRank0) 2)) (= rec_~p.offset 0) (<= 0 (div (+ (- 1) oldRank0) 2)))} is VALID [2022-02-21 03:36:01,519 INFO L272 TraceCheckUtils]: 2: Hoare triple {2081#(and (<= (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1) (div (+ (- 1) oldRank0) 2)) (= rec_~p.offset 0) (<= 0 (div (+ (- 1) oldRank0) 2)))} call #t~ret5 := rec(~p.base, ~p.offset); {1591#(and (or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select (select |#memory_int| |rec_#in~p.base|) 0)) 1))) unseeded) (= |rec_#in~p.offset| 0))} is VALID [2022-02-21 03:36:01,519 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:01,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:01,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,543 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 3 loop predicates [2022-02-21 03:36:01,543 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,773 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 96 transitions. cyclomatic complexity: 21. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 154 states and 179 transitions. Complement of second has 21 states. [2022-02-21 03:36:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:01,773 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:01,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:01,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 179 transitions. [2022-02-21 03:36:01,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,776 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 82 states and 96 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:01,776 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:36:01,776 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,777 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:01,777 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 154 states and 179 transitions. cyclomatic complexity: 32 [2022-02-21 03:36:01,777 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:36:01,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 154 letters. Loop has 154 letters. [2022-02-21 03:36:01,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 154 letters. Loop has 154 letters. [2022-02-21 03:36:01,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 154 letters. Loop has 154 letters. [2022-02-21 03:36:01,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:01,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:01,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 82 letters. Loop has 82 letters. [2022-02-21 03:36:01,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:01,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:36:01,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:01,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:36:01,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:01,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:01,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:36:01,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:36:01,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:36:01,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:01,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 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:01,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:36:01,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:01,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:01,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:01,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 82 states and 96 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 154 states and 179 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:01,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,791 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:36:01,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-02-21 03:36:01,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:36:01,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:36:01,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:36:01,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:01,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 179 transitions. cyclomatic complexity: 32 [2022-02-21 03:36:01,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 110 states and 135 transitions. [2022-02-21 03:36:01,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-02-21 03:36:01,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2022-02-21 03:36:01,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 135 transitions. [2022-02-21 03:36:01,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:01,803 INFO L681 BuchiCegarLoop]: Abstraction has 110 states and 135 transitions. [2022-02-21 03:36:01,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 135 transitions. [2022-02-21 03:36:01,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 74. [2022-02-21 03:36:01,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:01,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states and 135 transitions. Second operand has 74 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 03:36:01,807 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states and 135 transitions. Second operand has 74 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 03:36:01,807 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 74 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 03:36:01,807 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:01,812 INFO L93 Difference]: Finished difference Result 125 states and 147 transitions. [2022-02-21 03:36:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 147 transitions. [2022-02-21 03:36:01,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:01,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:01,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) Second operand 110 states and 135 transitions. [2022-02-21 03:36:01,813 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) Second operand 110 states and 135 transitions. [2022-02-21 03:36:01,814 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:01,819 INFO L93 Difference]: Finished difference Result 161 states and 187 transitions. [2022-02-21 03:36:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2022-02-21 03:36:01,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:01,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:01,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:01,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.196078431372549) internal successors, (61), 54 states have internal predecessors, (61), 10 states have call successors, (10), 10 states have call predecessors, (10), 13 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2022-02-21 03:36:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-02-21 03:36:01,822 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-02-21 03:36:01,822 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-02-21 03:36:01,822 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:01,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2022-02-21 03:36:01,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:01,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:01,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:01,823 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:01,823 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:01,823 INFO L791 eck$LassoCheckResult]: Stem: 2272#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 2294#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 2282#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 2289#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2313#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2298#recFINAL assume true; 2292#recEXIT >#30#return; 2293#L23-1 main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; 2279#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 2280#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 2288#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2322#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 2278#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 2285#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2286#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2345#recFINAL assume true; 2290#recEXIT >#28#return; 2291#L15-1 #res := #t~ret5;havoc #t~ret5; 2323#recFINAL assume true; 2321#recEXIT >#30#return; 2295#L23-1 [2022-02-21 03:36:01,823 INFO L793 eck$LassoCheckResult]: Loop: 2295#L23-1 main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; 2296#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 2325#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 2328#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 2324#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 2326#recFINAL assume true; 2329#recEXIT >#30#return; 2295#L23-1 [2022-02-21 03:36:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1572162950, now seen corresponding path program 4 times [2022-02-21 03:36:01,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089061289] [2022-02-21 03:36:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,855 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:01,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,857 INFO L85 PathProgramCache]: Analyzing trace with hash -523709736, now seen corresponding path program 3 times [2022-02-21 03:36:01,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630588442] [2022-02-21 03:36:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,867 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,877 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:01,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1341076915, now seen corresponding path program 5 times [2022-02-21 03:36:01,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:01,878 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968827083] [2022-02-21 03:36:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:01,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:01,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:01,910 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:03,838 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:03,838 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:03,838 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:03,838 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:03,838 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:03,838 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:03,839 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:03,839 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:03,839 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration5_Lasso [2022-02-21 03:36:03,839 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:03,839 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:03,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:03,844 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:03,846 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:04,015 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:36:04,017 WARN L259 bleTransFormulaUtils]: 5 quantified variables [2022-02-21 03:36:04,019 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:04,021 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:04,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:04,024 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:04,241 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:04,241 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:04,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,242 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:04,243 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:04,244 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:04,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:04,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:04,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:04,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,267 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:04,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,269 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:04,269 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:04,271 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:04,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,295 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:04,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,296 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:04,297 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:04,298 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:04,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,325 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:04,327 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:04,327 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:04,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,336 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,336 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,355 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:04,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,357 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:04,357 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:04,359 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:04,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,365 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2022-02-21 03:36:04,365 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:36:04,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,370 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2022-02-21 03:36:04,370 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:36:04,382 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,399 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:04,400 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:04,401 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:04,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,408 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,408 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,426 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:04,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,427 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:04,428 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:04,430 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:04,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,438 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:04,453 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:04,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,455 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:04,455 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:04,457 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:04,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:04,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:04,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:04,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:04,466 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:04,466 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:04,472 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:04,477 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:36:04,477 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:36:04,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:04,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:04,478 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:04,479 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:04,480 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:04,486 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:04,486 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:04,486 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~ret9#1) = 1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_#t~ret9#1 Supporting invariants [] [2022-02-21 03:36:04,502 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:04,508 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:04,511 INFO L390 LassoCheck]: Loop: "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1;" "assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#30#return;" [2022-02-21 03:36:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:04,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:04,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {2868#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2868#unseeded} is VALID [2022-02-21 03:36:04,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {2868#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2868#unseeded} is VALID [2022-02-21 03:36:04,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2868#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {2868#unseeded} is VALID [2022-02-21 03:36:04,738 INFO L272 TraceCheckUtils]: 3: Hoare triple {2868#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,741 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2868#unseeded} #30#return; {2868#unseeded} is VALID [2022-02-21 03:36:04,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {2868#unseeded} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {2868#unseeded} is VALID [2022-02-21 03:36:04,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {2868#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {2868#unseeded} is VALID [2022-02-21 03:36:04,742 INFO L272 TraceCheckUtils]: 10: Hoare triple {2868#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,744 INFO L272 TraceCheckUtils]: 13: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,746 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:04,748 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2900#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2868#unseeded} #30#return; {2868#unseeded} is VALID [2022-02-21 03:36:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:04,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:04,882 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 15 treesize of output 7 [2022-02-21 03:36:04,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {2871#(>= oldRank0 (+ |ULTIMATE.start_main_#t~ret9#1| |ULTIMATE.start_main_~i~0#1|))} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {2952#(<= |ULTIMATE.start_main_~i~0#1| oldRank0)} is VALID [2022-02-21 03:36:04,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {2952#(<= |ULTIMATE.start_main_~i~0#1| oldRank0)} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {2956#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:36:04,907 INFO L272 TraceCheckUtils]: 2: Hoare triple {2956#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {2960#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:04,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {2960#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {2964#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:04,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {2964#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {2968#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:04,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {2968#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {2968#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:04,910 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2968#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} {2956#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} #30#return; {2886#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_#t~ret9#1| |ULTIMATE.start_main_~i~0#1|))) unseeded)} is VALID [2022-02-21 03:36:04,910 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:04,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:04,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:04,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:04,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:04,930 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 03:36:04,930 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,116 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 118 states and 139 transitions. Complement of second has 21 states. [2022-02-21 03:36:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:05,116 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:05,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:05,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:05,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 139 transitions. [2022-02-21 03:36:05,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:05,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,119 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:05,120 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:36:05,120 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:05,122 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:05,122 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 118 states and 139 transitions. cyclomatic complexity: 28 [2022-02-21 03:36:05,122 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:36:05,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:36:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:36:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:36:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:05,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:05,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:05,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:05,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,131 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2022-02-21 03:36:05,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,134 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:05,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {2868#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2868#unseeded} is VALID [2022-02-21 03:36:05,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {2868#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2868#unseeded} is VALID [2022-02-21 03:36:05,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {2868#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {2868#unseeded} is VALID [2022-02-21 03:36:05,329 INFO L272 TraceCheckUtils]: 3: Hoare triple {2868#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,332 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2868#unseeded} #30#return; {2868#unseeded} is VALID [2022-02-21 03:36:05,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {2868#unseeded} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {2868#unseeded} is VALID [2022-02-21 03:36:05,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2868#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {2868#unseeded} is VALID [2022-02-21 03:36:05,333 INFO L272 TraceCheckUtils]: 10: Hoare triple {2868#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,335 INFO L272 TraceCheckUtils]: 13: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,337 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,338 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3135#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2868#unseeded} #30#return; {2868#unseeded} is VALID [2022-02-21 03:36:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:05,476 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 15 treesize of output 7 [2022-02-21 03:36:05,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {2871#(>= oldRank0 (+ |ULTIMATE.start_main_#t~ret9#1| |ULTIMATE.start_main_~i~0#1|))} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {3187#(<= |ULTIMATE.start_main_~i~0#1| oldRank0)} is VALID [2022-02-21 03:36:05,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {3187#(<= |ULTIMATE.start_main_~i~0#1| oldRank0)} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {3191#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:36:05,508 INFO L272 TraceCheckUtils]: 2: Hoare triple {3191#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {3195#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:05,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {3195#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3199#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:05,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {3199#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3203#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:05,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {3203#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {3203#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:05,511 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3203#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} {3191#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} #30#return; {2886#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_#t~ret9#1| |ULTIMATE.start_main_~i~0#1|))) unseeded)} is VALID [2022-02-21 03:36:05,511 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:05,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:05,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 03:36:05,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,700 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 118 states and 139 transitions. Complement of second has 21 states. [2022-02-21 03:36:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:05,700 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:05,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:05,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:05,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 139 transitions. [2022-02-21 03:36:05,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:05,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:05,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:05,702 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:05,702 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:36:05,702 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:05,703 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:05,703 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 118 states and 139 transitions. cyclomatic complexity: 28 [2022-02-21 03:36:05,703 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:36:05,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:36:05,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:36:05,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:36:05,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:05,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:05,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:05,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:05,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:05,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:05,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:05,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:05,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:05,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 139 transitions. cyclomatic complexity: 28 Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:05,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,712 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2022-02-21 03:36:05,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:05,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:05,713 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:05,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {2868#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2868#unseeded} is VALID [2022-02-21 03:36:05,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {2868#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2868#unseeded} is VALID [2022-02-21 03:36:05,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {2868#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {2868#unseeded} is VALID [2022-02-21 03:36:05,914 INFO L272 TraceCheckUtils]: 3: Hoare triple {2868#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,917 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2868#unseeded} #30#return; {2868#unseeded} is VALID [2022-02-21 03:36:05,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {2868#unseeded} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {2868#unseeded} is VALID [2022-02-21 03:36:05,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {2868#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {2868#unseeded} is VALID [2022-02-21 03:36:05,918 INFO L272 TraceCheckUtils]: 10: Hoare triple {2868#unseeded} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,919 INFO L272 TraceCheckUtils]: 13: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret5 := rec(~p.base, ~p.offset); {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,922 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #28#return; {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := #t~ret5;havoc #t~ret5; {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:36:05,923 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3370#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2868#unseeded} #30#return; {2868#unseeded} is VALID [2022-02-21 03:36:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:05,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:06,063 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 15 treesize of output 7 [2022-02-21 03:36:06,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {2871#(>= oldRank0 (+ |ULTIMATE.start_main_#t~ret9#1| |ULTIMATE.start_main_~i~0#1|))} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {3422#(<= |ULTIMATE.start_main_~i~0#1| oldRank0)} is VALID [2022-02-21 03:36:06,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| oldRank0)} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {3426#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:36:06,087 INFO L272 TraceCheckUtils]: 2: Hoare triple {3426#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {3430#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:06,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {3430#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {3434#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:06,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {3434#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {3438#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:06,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {3438#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {3438#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:06,089 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3438#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} {3426#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} #30#return; {2886#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_#t~ret9#1| |ULTIMATE.start_main_~i~0#1|))) unseeded)} is VALID [2022-02-21 03:36:06,089 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:06,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:06,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:06,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,108 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 6 loop predicates [2022-02-21 03:36:06,108 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18 Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:06,274 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 87 transitions. cyclomatic complexity: 18. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 143 states and 169 transitions. Complement of second has 22 states. [2022-02-21 03:36:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:06,274 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:06,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:06,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:06,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:06,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:06,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:06,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:06,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:06,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 169 transitions. [2022-02-21 03:36:06,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:06,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:06,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:06,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:06,277 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:36:06,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:06,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:06,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:06,278 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 143 states and 169 transitions. cyclomatic complexity: 34 [2022-02-21 03:36:06,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:06,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:06,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:06,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:06,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 143 letters. Loop has 143 letters. [2022-02-21 03:36:06,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 143 letters. Loop has 143 letters. [2022-02-21 03:36:06,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 143 letters. Loop has 143 letters. [2022-02-21 03:36:06,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:06,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:06,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:36:06,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:06,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:06,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:06,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:06,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:06,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 7 letters. [2022-02-21 03:36:06,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:06,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:06,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:36:06,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:06,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:06,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:36:06,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:36:06,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:36:06,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 13 letters. [2022-02-21 03:36:06,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 143 states and 169 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 13 letters. [2022-02-21 03:36:06,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,289 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:36:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-02-21 03:36:06,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:36:06,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 28 letters. Loop has 7 letters. [2022-02-21 03:36:06,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 21 letters. Loop has 14 letters. [2022-02-21 03:36:06,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:06,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 169 transitions. cyclomatic complexity: 34 [2022-02-21 03:36:06,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:06,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 94 states and 109 transitions. [2022-02-21 03:36:06,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-02-21 03:36:06,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-02-21 03:36:06,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 109 transitions. [2022-02-21 03:36:06,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:06,299 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 109 transitions. [2022-02-21 03:36:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 109 transitions. [2022-02-21 03:36:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 32. [2022-02-21 03:36:06,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:06,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states and 109 transitions. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:36:06,305 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states and 109 transitions. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:36:06,306 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:36:06,306 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:06,308 INFO L93 Difference]: Finished difference Result 109 states and 127 transitions. [2022-02-21 03:36:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-02-21 03:36:06,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:06,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:06,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 94 states and 109 transitions. [2022-02-21 03:36:06,309 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Second operand 94 states and 109 transitions. [2022-02-21 03:36:06,309 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:06,311 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2022-02-21 03:36:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions. [2022-02-21 03:36:06,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:06,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:06,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:06,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:06,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-02-21 03:36:06,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-02-21 03:36:06,313 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-21 03:36:06,313 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-21 03:36:06,313 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:06,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. [2022-02-21 03:36:06,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:06,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:06,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:06,314 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:36:06,314 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:06,314 INFO L791 eck$LassoCheckResult]: Stem: 3618#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3619#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 3641#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 3627#L23 [2022-02-21 03:36:06,314 INFO L793 eck$LassoCheckResult]: Loop: 3627#L23 call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);< 3636#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 3645#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; 3630#L15 call #t~ret5 := rec(~p.base, ~p.offset);< 3632#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 3634#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; 3649#recFINAL assume true; 3647#recEXIT >#28#return; 3646#L15-1 #res := #t~ret5;havoc #t~ret5; 3644#recFINAL assume true; 3643#recEXIT >#30#return; 3640#L23-1 main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; 3626#L20-2 assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; 3627#L23 [2022-02-21 03:36:06,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:06,314 INFO L85 PathProgramCache]: Analyzing trace with hash 37808, now seen corresponding path program 1 times [2022-02-21 03:36:06,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:06,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586339946] [2022-02-21 03:36:06,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:06,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:06,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:06,322 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:06,323 INFO L85 PathProgramCache]: Analyzing trace with hash -669629144, now seen corresponding path program 1 times [2022-02-21 03:36:06,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:06,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260163191] [2022-02-21 03:36:06,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:06,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:06,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:06,337 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:06,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:06,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1720097319, now seen corresponding path program 6 times [2022-02-21 03:36:06,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:06,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799320173] [2022-02-21 03:36:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:06,354 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:06,377 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:07,047 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:07,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:07,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:07,048 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:07,048 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:07,048 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,048 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:07,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:07,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex3.i_Iteration6_Lasso [2022-02-21 03:36:07,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:07,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:07,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:36:07,051 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:07,053 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:07,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:36:07,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:36:07,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:36:07,059 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:07,159 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:07,160 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:07,161 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:07,331 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:07,331 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:07,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,332 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:07,333 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:07,335 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:07,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:07,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:07,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:07,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:07,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:07,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:07,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:07,362 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:07,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,363 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:07,363 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:07,365 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:07,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:07,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:07,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:07,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:07,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:07,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:07,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:07,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:07,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:07,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,387 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:07,387 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:07,389 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:07,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:07,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:07,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:07,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:07,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:07,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:07,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:07,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:07,410 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:07,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,411 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:07,412 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:07,413 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:07,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:07,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:07,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:07,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:07,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:07,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:07,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:07,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:07,435 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:07,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,436 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:07,436 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:07,442 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:07,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:07,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:07,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:07,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:07,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:07,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:07,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:07,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 03:36:07,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,466 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:07,467 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:07,467 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:07,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:07,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:07,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:07,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:07,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:07,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:07,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:07,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:07,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:07,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,490 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:07,490 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:07,492 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:07,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:07,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:07,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:07,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:07,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:07,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:07,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:07,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:07,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,517 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:07,518 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:07,519 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:07,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:07,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:07,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:07,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:07,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:07,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:07,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:07,547 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:36:07,547 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:36:07,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:07,553 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:07,554 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:07,555 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:07,561 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:07,561 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:07,561 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:36:07,576 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:07,582 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:07,585 INFO L390 LassoCheck]: Loop: "call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4;" "call #t~ret5 := rec(~p.base, ~p.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0;" "assume true;" >"#28#return;" "#res := #t~ret5;havoc #t~ret5;" "assume true;" >"#30#return;" "main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1;" "assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1;" [2022-02-21 03:36:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:07,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:07,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:07,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {4012#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {4012#unseeded} is VALID [2022-02-21 03:36:07,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {4012#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~ret9#1, main_~op~0#1.base, main_~op~0#1.offset, main_~i~0#1;main_~i~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4012#unseeded} is VALID [2022-02-21 03:36:07,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {4012#unseeded} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {4012#unseeded} is VALID [2022-02-21 03:36:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:07,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-21 03:36:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:07,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:07,721 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 15 treesize of output 7 [2022-02-21 03:36:07,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {4015#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~ret9#1 := rec(main_~op~0#1.base, main_~op~0#1.offset); {4041#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {4041#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {4041#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {4041#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~mem3 := read~int(~p.base, ~p.offset, 4);#t~post4 := #t~mem3;call write~int(#t~post4 - 1, ~p.base, ~p.offset, 4);havoc #t~mem3;havoc #t~post4; {4041#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,844 INFO L272 TraceCheckUtils]: 3: Hoare triple {4041#(<= |old(oldRank0)| oldRank0)} call #t~ret5 := rec(~p.base, ~p.offset); {4041#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:07,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {4041#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {4054#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:07,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {4054#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);#res := ~pv~0; {4058#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:07,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {4058#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {4058#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:07,850 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4058#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} {4041#(<= |old(oldRank0)| oldRank0)} #28#return; {4065#(and (<= |old(oldRank0)| oldRank0) (< |rec_#t~ret5| 0))} is VALID [2022-02-21 03:36:07,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {4065#(and (<= |old(oldRank0)| oldRank0) (< |rec_#t~ret5| 0))} #res := #t~ret5;havoc #t~ret5; {4058#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:07,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {4058#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} assume true; {4058#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:07,851 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4058#(and (< |rec_#res| 0) (<= |old(oldRank0)| oldRank0))} {4015#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} #30#return; {4075#(and (< |ULTIMATE.start_main_#t~ret9#1| 0) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:36:07,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {4075#(and (< |ULTIMATE.start_main_#t~ret9#1| 0) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} main_~i~0#1 := main_~i~0#1 + main_#t~ret9#1;havoc main_#t~ret9#1; {4079#(< |ULTIMATE.start_main_~i~0#1| oldRank0)} is VALID [2022-02-21 03:36:07,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {4079#(< |ULTIMATE.start_main_~i~0#1| oldRank0)} assume !!(main_~i~0#1 > 0);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(main_#t~nondet8#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~nondet8#1; {4030#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:36:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:36:07,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:36:07,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:07,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 13 letters. [2022-02-21 03:36:07,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,870 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-02-21 03:36:07,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8 Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:36:07,991 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 38 transitions. cyclomatic complexity: 8. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 69 states and 86 transitions. Complement of second has 22 states. [2022-02-21 03:36:07,991 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:36:07,991 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:07,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 38 transitions. cyclomatic complexity: 8 [2022-02-21 03:36:07,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:07,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:07,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:36:07,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:07,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:07,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:07,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 86 transitions. [2022-02-21 03:36:07,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:07,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:07,994 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 38 transitions. cyclomatic complexity: 8 [2022-02-21 03:36:07,994 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:36:07,994 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:36:07,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:36:07,995 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:07,995 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 69 states and 86 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:07,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 86 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:07,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:07,995 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:07,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 13 letters. [2022-02-21 03:36:07,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 13 letters. [2022-02-21 03:36:07,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 13 letters. [2022-02-21 03:36:07,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:36:07,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 6 letters. [2022-02-21 03:36:07,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:36:07,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 69 letters. Loop has 69 letters. [2022-02-21 03:36:07,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 69 letters. Loop has 69 letters. [2022-02-21 03:36:07,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 69 letters. Loop has 69 letters. [2022-02-21 03:36:07,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:36:07,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 32 letters. [2022-02-21 03:36:07,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:36:07,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:07,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:36:07,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:36:07,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:36:07,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 14 letters. Loop has 13 letters. [2022-02-21 03:36:07,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:36:07,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 13 letters. [2022-02-21 03:36:07,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 13 letters. [2022-02-21 03:36:07,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 9 letters. Loop has 13 letters. [2022-02-21 03:36:07,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 13 letters. [2022-02-21 03:36:07,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:07,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 13 letters. [2022-02-21 03:36:08,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 13 letters. [2022-02-21 03:36:08,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:36:08,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 14 letters. Loop has 13 letters. [2022-02-21 03:36:08,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:36:08,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 38 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:36:08,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 6 letters. [2022-02-21 03:36:08,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 69 states and 86 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 6 letters. [2022-02-21 03:36:08,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,001 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:36:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2022-02-21 03:36:08,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 13 letters. [2022-02-21 03:36:08,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 16 letters. Loop has 13 letters. [2022-02-21 03:36:08,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 14 transitions. Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:08,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:08,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 86 transitions. cyclomatic complexity: 21 [2022-02-21 03:36:08,004 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:08,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2022-02-21 03:36:08,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:08,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:08,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:08,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:08,004 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:08,004 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:08,004 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:08,004 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:36:08,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:36:08,005 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:08,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:08,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:36:08 BoogieIcfgContainer [2022-02-21 03:36:08,009 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:36:08,009 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:36:08,009 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:36:08,010 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:36:08,010 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:47" (3/4) ... [2022-02-21 03:36:08,011 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:36:08,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:36:08,012 INFO L158 Benchmark]: Toolchain (without parser) took 20910.25ms. Allocated memory was 102.8MB in the beginning and 251.7MB in the end (delta: 148.9MB). Free memory was 73.0MB in the beginning and 124.7MB in the end (delta: -51.6MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2022-02-21 03:36:08,012 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:08,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.79ms. Allocated memory is still 102.8MB. Free memory was 72.8MB in the beginning and 77.5MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:36:08,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.03ms. Allocated memory is still 102.8MB. Free memory was 77.5MB in the beginning and 76.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:08,013 INFO L158 Benchmark]: Boogie Preprocessor took 47.44ms. Allocated memory is still 102.8MB. Free memory was 75.8MB in the beginning and 74.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:36:08,013 INFO L158 Benchmark]: RCFGBuilder took 292.46ms. Allocated memory is still 102.8MB. Free memory was 74.7MB in the beginning and 64.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:36:08,013 INFO L158 Benchmark]: BuchiAutomizer took 20309.57ms. Allocated memory was 102.8MB in the beginning and 251.7MB in the end (delta: 148.9MB). Free memory was 63.8MB in the beginning and 124.7MB in the end (delta: -60.9MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2022-02-21 03:36:08,013 INFO L158 Benchmark]: Witness Printer took 2.16ms. Allocated memory is still 251.7MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:08,014 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.15ms. Allocated memory is still 102.8MB. Free memory is still 57.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.79ms. Allocated memory is still 102.8MB. Free memory was 72.8MB in the beginning and 77.5MB in the end (delta: -4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.03ms. Allocated memory is still 102.8MB. Free memory was 77.5MB in the beginning and 76.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.44ms. Allocated memory is still 102.8MB. Free memory was 75.8MB in the beginning and 74.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 292.46ms. Allocated memory is still 102.8MB. Free memory was 74.7MB in the beginning and 64.1MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 20309.57ms. Allocated memory was 102.8MB in the beginning and 251.7MB in the end (delta: 148.9MB). Free memory was 63.8MB in the beginning and 124.7MB in the end (delta: -60.9MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. * Witness Printer took 2.16ms. Allocated memory is still 251.7MB. Free memory is still 124.7MB. 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 6 terminating modules (0 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function i and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][0] + 1 and consists of 8 locations. One deterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. One deterministic module has affine ranking function i and consists of 8 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][0] + 1 and consists of 8 locations. One nondeterministic module has affine ranking function aux-rec(op)-aux + i and consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.2s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 14.0s. Construction of modules took 0.7s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 82 states and ocurred in iteration 3. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 118 mSDtfsCounter, 427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital166 mio100 ax100 hnf100 lsp95 ukn60 mio100 lsp37 div100 bol100 ite100 ukn100 eq175 hnf91 smp98 dnf108 smp96 tf101 neg97 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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:08,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-02-21 03:36:08,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE