./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.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_ex2.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 b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:35:45,267 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:35:45,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:35:45,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:35:45,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:35:45,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:35:45,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:35:45,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:35:45,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:35:45,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:35:45,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:35:45,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:35:45,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:35:45,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:35:45,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:35:45,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:35:45,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:35:45,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:35:45,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:35:45,333 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:35:45,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:35:45,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:35:45,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:35:45,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:35:45,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:35:45,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:35:45,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:35:45,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:35:45,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:35:45,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:35:45,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:35:45,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:35:45,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:35:45,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:35:45,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:35:45,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:35:45,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:35:45,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:35:45,349 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:35:45,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:35:45,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:35:45,351 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:45,375 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:35:45,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:35:45,376 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:35:45,376 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:35:45,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:35:45,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:35:45,377 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:35:45,377 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:35:45,377 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:35:45,378 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:35:45,378 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:35:45,378 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:35:45,379 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:35:45,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:35:45,379 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:35:45,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:35:45,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:35:45,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:35:45,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:35:45,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:35:45,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:35:45,380 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:35:45,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:35:45,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:35:45,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:35:45,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:35:45,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:35:45,382 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:35:45,383 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:35:45,383 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 -> b91dcc12f43fdd03af0529f07bf7885945925554291ddde3b9ca40d8f32b93c1 [2022-02-21 03:35:45,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:35:45,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:35:45,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:35:45,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:35:45,606 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:35:45,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2022-02-21 03:35:45,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f6f6115/338cd33f113942459a4d40fd514f5ae8/FLAGdbcc59a20 [2022-02-21 03:35:46,023 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:35:46,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2.i [2022-02-21 03:35:46,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f6f6115/338cd33f113942459a4d40fd514f5ae8/FLAGdbcc59a20 [2022-02-21 03:35:46,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f6f6115/338cd33f113942459a4d40fd514f5ae8 [2022-02-21 03:35:46,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:35:46,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:35:46,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:46,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:35:46,061 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:35:46,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:46" (1/1) ... [2022-02-21 03:35:46,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518303e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:46, skipping insertion in model container [2022-02-21 03:35:46,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:35:46" (1/1) ... [2022-02-21 03:35:46,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:35:46,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:35:46,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:46,269 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:35:46,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:35:46,309 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:35:46,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:46 WrapperNode [2022-02-21 03:35:46,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:35:46,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:46,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:35:46,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:35:46,329 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:46" (1/1) ... [2022-02-21 03:35:46,336 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:46" (1/1) ... [2022-02-21 03:35:46,363 INFO L137 Inliner]: procedures = 11, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 28 [2022-02-21 03:35:46,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:35:46,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:35:46,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:35:46,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:35:46,369 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:46" (1/1) ... [2022-02-21 03:35:46,376 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:46" (1/1) ... [2022-02-21 03:35:46,385 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:46" (1/1) ... [2022-02-21 03:35:46,385 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:46" (1/1) ... [2022-02-21 03:35:46,400 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:46" (1/1) ... [2022-02-21 03:35:46,415 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:46" (1/1) ... [2022-02-21 03:35:46,418 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:46" (1/1) ... [2022-02-21 03:35:46,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:35:46,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:35:46,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:35:46,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:35:46,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:46" (1/1) ... [2022-02-21 03:35:46,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:35:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:46,460 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:46,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:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:35:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2022-02-21 03:35:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2022-02-21 03:35:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:35:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:35:46,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:35:46,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:35:46,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:35:46,528 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:35:46,529 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:35:46,667 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:35:46,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:35:46,672 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:35:46,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:46 BoogieIcfgContainer [2022-02-21 03:35:46,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:35:46,674 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:35:46,674 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:35:46,676 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:35:46,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:46,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:35:46" (1/3) ... [2022-02-21 03:35:46,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73097a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:46, skipping insertion in model container [2022-02-21 03:35:46,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:46,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:35:46" (2/3) ... [2022-02-21 03:35:46,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73097a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:35:46, skipping insertion in model container [2022-02-21 03:35:46,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:35:46,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:35:46" (3/3) ... [2022-02-21 03:35:46,679 INFO L388 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2.i [2022-02-21 03:35:46,722 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:35:46,722 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:35:46,722 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:35:46,723 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:35:46,723 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:35:46,723 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:35:46,723 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:35:46,723 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:35:46,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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:46,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:46,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:46,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:46,753 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:46,753 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:46,753 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:35:46,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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:46,756 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:46,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:46,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:46,756 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:46,757 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:46,761 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; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; 12#L23-3true [2022-02-21 03:35:46,761 INFO L793 eck$LassoCheckResult]: Loop: 12#L23-3true call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 9#L23-1true assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 7#L26true call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);< 11#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 10#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 15#recFINALtrue assume true; 13#recEXITtrue >#31#return; 5#L26-1true call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; 12#L23-3true [2022-02-21 03:35:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2022-02-21 03:35:46,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706761018] [2022-02-21 03:35:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:46,907 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:46,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:46,909 INFO L85 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2022-02-21 03:35:46,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:46,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242299580] [2022-02-21 03:35:46,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:46,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:47,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {30#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {31#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {31#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {24#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} #31#return; {22#false} is VALID [2022-02-21 03:35:47,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#true} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {23#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} is VALID [2022-02-21 03:35:47,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {24#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} is VALID [2022-02-21 03:35:47,152 INFO L272 TraceCheckUtils]: 2: Hoare triple {24#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {29#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:47,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {30#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {31#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {31#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,157 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {24#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} #31#return; {22#false} is VALID [2022-02-21 03:35:47,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {22#false} is VALID [2022-02-21 03:35:47,158 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:47,159 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:47,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242299580] [2022-02-21 03:35:47,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242299580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:35:47,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:35:47,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:35:47,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111374618] [2022-02-21 03:35:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:35:47,165 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:47,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:47,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:35:47,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:35:47,188 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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.0) internal successors, (6), 5 states have internal predecessors, (6), 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:47,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:47,385 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:35:47,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:35:47,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 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:47,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:47,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2022-02-21 03:35:47,402 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:47,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2022-02-21 03:35:47,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:35:47,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:35:47,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-02-21 03:35:47,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:47,407 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:35:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-02-21 03:35:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:35:47,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:47,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:47,423 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:47,424 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:47,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:47,426 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:35:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:35:47,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:47,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:47,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 14 states and 16 transitions. [2022-02-21 03:35:47,428 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 14 states and 16 transitions. [2022-02-21 03:35:47,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:47,429 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-02-21 03:35:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:35:47,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:47,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:47,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:47,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:35:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-21 03:35:47,432 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:35:47,432 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-21 03:35:47,432 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:35:47,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2022-02-21 03:35:47,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:47,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:47,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:47,434 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:47,434 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:47,434 INFO L791 eck$LassoCheckResult]: Stem: 51#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 52#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; 58#L23-3 [2022-02-21 03:35:47,434 INFO L793 eck$LassoCheckResult]: Loop: 58#L23-3 call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 60#L23-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 54#L26 call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);< 59#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 55#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 59#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 53#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 56#recFINAL assume true; 61#recEXIT >#29#return; 62#L17-1 #res := #t~ret6;havoc #t~ret6; 63#recFINAL assume true; 64#recEXIT >#31#return; 57#L26-1 call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; 58#L23-3 [2022-02-21 03:35:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2022-02-21 03:35:47,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:47,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927104117] [2022-02-21 03:35:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,444 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:47,450 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2022-02-21 03:35:47,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:47,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510632120] [2022-02-21 03:35:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:47,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:47,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {114#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:47,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {114#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,668 INFO L272 TraceCheckUtils]: 2: Hoare triple {114#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {112#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:47,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,672 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {114#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:47,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} #res := #t~ret6;havoc #t~ret6; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:47,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} assume true; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:47,675 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} {101#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} #31#return; {99#false} is VALID [2022-02-21 03:35:47,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#true} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {100#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} is VALID [2022-02-21 03:35:47,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {100#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {101#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} is VALID [2022-02-21 03:35:47,678 INFO L272 TraceCheckUtils]: 2: Hoare triple {101#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {112#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:47,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {112#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {114#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,681 INFO L272 TraceCheckUtils]: 5: Hoare triple {114#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {112#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:47,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {112#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:47,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {113#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:47,686 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {114#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:47,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} #res := #t~ret6;havoc #t~ret6; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:47,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} assume true; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:47,688 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} {101#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} #31#return; {99#false} is VALID [2022-02-21 03:35:47,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#false} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {99#false} is VALID [2022-02-21 03:35:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:35:47,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:47,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510632120] [2022-02-21 03:35:47,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510632120] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:47,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467893677] [2022-02-21 03:35:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:47,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:47,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:47,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:47,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:35:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:47,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-21 03:35:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:47,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:47,967 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:35:47,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2022-02-21 03:35:50,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#true} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {124#(<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} is VALID [2022-02-21 03:35:50,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#(<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {128#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|)) (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} is VALID [2022-02-21 03:35:50,791 INFO L272 TraceCheckUtils]: 2: Hoare triple {128#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|)) (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {132#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:50,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {132#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {136#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:50,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {136#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {140#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_54 Int)) (and (= (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_54)) |#memory_int|) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_54 1)))) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:50,794 INFO L272 TraceCheckUtils]: 5: Hoare triple {140#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_54 Int)) (and (= (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_54)) |#memory_int|) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_54 1)))) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {132#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:50,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {132#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {147#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) |rec_#t~mem1|))} is VALID [2022-02-21 03:35:50,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {147#(and (= |#memory_int| |old(#memory_int)|) (<= (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) |rec_#t~mem1|))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {151#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-02-21 03:35:50,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (= |#memory_int| |old(#memory_int)|))} assume true; {151#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-02-21 03:35:50,797 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {151#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (= |#memory_int| |old(#memory_int)|))} {140#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_54 Int)) (and (= (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_54)) |#memory_int|) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_54 1)))) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {158#(and (exists ((v_ArrVal_54 Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_54))) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_54 1)))) (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:50,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {158#(and (exists ((v_ArrVal_54 Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_54))) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_54 1)))) (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} #res := #t~ret6;havoc #t~ret6; {158#(and (exists ((v_ArrVal_54 Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_54))) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_54 1)))) (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:50,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {158#(and (exists ((v_ArrVal_54 Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_54))) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_54 1)))) (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} assume true; {158#(and (exists ((v_ArrVal_54 Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_54))) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_54 1)))) (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:50,800 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {158#(and (exists ((v_ArrVal_54 Int)) (and (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_54))) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_54 1)))) (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} {128#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|)) (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} #31#return; {99#false} is VALID [2022-02-21 03:35:50,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#false} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {99#false} is VALID [2022-02-21 03:35:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:35:50,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:35:51,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#false} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {99#false} is VALID [2022-02-21 03:35:51,492 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} {174#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} #31#return; {99#false} is VALID [2022-02-21 03:35:51,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} assume true; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} #res := #t~ret6;havoc #t~ret6; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,494 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {187#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} #29#return; {119#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:51,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:51,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(or (<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0) (not (< |rec_#t~mem1| 0)))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {120#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:51,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(or (<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0) (<= 0 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {197#(or (<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0) (not (< |rec_#t~mem1| 0)))} is VALID [2022-02-21 03:35:51,497 INFO L272 TraceCheckUtils]: 5: Hoare triple {187#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {201#(or (<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0) (<= 0 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)))} is VALID [2022-02-21 03:35:51,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {205#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {187#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (<= 0 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} is VALID [2022-02-21 03:35:51,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {209#(or (<= 1 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {205#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} is VALID [2022-02-21 03:35:51,499 INFO L272 TraceCheckUtils]: 2: Hoare triple {174#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {209#(or (<= 1 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} is VALID [2022-02-21 03:35:51,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(or (not (< 1 |ULTIMATE.start_main_#t~mem9#1|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {174#(<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} is VALID [2022-02-21 03:35:51,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#true} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {213#(or (not (< 1 |ULTIMATE.start_main_#t~mem9#1|)) (<= 1 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)))} is VALID [2022-02-21 03:35:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:35:51,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467893677] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:35:51,501 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:35:51,502 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 23 [2022-02-21 03:35:51,502 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238756340] [2022-02-21 03:35:51,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:35:51,502 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:35:51,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:35:51,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:35:51,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=448, Unknown=4, NotChecked=0, Total=552 [2022-02-21 03:35:51,504 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:35:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:52,692 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:35:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:35:52,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-21 03:35:52,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:35:52,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2022-02-21 03:35:52,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:52,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 03:35:52,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:35:52,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:35:52,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-02-21 03:35:52,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:35:52,732 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:35:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-02-21 03:35:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-21 03:35:52,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:35:52,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:52,733 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:52,733 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:52,734 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:35:52,735 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:35:52,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:52,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:52,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 17 states and 19 transitions. [2022-02-21 03:35:52,735 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 17 states and 19 transitions. [2022-02-21 03:35:52,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:35:52,737 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:35:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:35:52,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:35:52,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:35:52,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:35:52,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:35:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:35:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 03:35:52,739 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:35:52,739 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:35:52,739 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:35:52,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:35:52,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:35:52,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:35:52,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:35:52,740 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:35:52,741 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:35:52,741 INFO L791 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; 244#L23-3 [2022-02-21 03:35:52,741 INFO L793 eck$LassoCheckResult]: Loop: 244#L23-3 call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 246#L23-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 240#L26 call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);< 245#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 239#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 241#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 245#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 239#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 241#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 245#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 239#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 242#recFINAL assume true; 247#recEXIT >#29#return; 248#L17-1 #res := #t~ret6;havoc #t~ret6; 249#recFINAL assume true; 253#recEXIT >#29#return; 251#L17-1 #res := #t~ret6;havoc #t~ret6; 252#recFINAL assume true; 250#recEXIT >#31#return; 243#L26-1 call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; 244#L23-3 [2022-02-21 03:35:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2022-02-21 03:35:52,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:52,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468427253] [2022-02-21 03:35:52,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:35:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:35:52,756 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:35:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:35:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2022-02-21 03:35:52,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:35:52,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010983740] [2022-02-21 03:35:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:35:52,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:35:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:52,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:52,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:35:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:52,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,964 INFO L272 TraceCheckUtils]: 2: Hoare triple {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:52,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,967 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} #res := #t~ret6;havoc #t~ret6; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} assume true; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,969 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:35:52,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,971 INFO L272 TraceCheckUtils]: 2: Hoare triple {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:52,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,974 INFO L272 TraceCheckUtils]: 5: Hoare triple {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:52,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,976 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} #res := #t~ret6;havoc #t~ret6; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} assume true; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,978 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:35:52,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} #res := #t~ret6;havoc #t~ret6; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:35:52,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} assume true; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:35:52,980 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} {296#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} #31#return; {294#false} is VALID [2022-02-21 03:35:52,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#true} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {295#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} is VALID [2022-02-21 03:35:52,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#(= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {296#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} is VALID [2022-02-21 03:35:52,982 INFO L272 TraceCheckUtils]: 2: Hoare triple {296#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:52,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,985 INFO L272 TraceCheckUtils]: 5: Hoare triple {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:52,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,987 INFO L272 TraceCheckUtils]: 8: Hoare triple {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-21 03:35:52,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {313#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:52,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#(and (= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:35:52,990 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} #res := #t~ret6;havoc #t~ret6; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} assume true; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:35:52,992 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} {315#(and (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ (select (select |#memory_int| rec_~p.base) rec_~p.offset) 1)) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:35:52,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} #res := #t~ret6;havoc #t~ret6; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:35:52,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} assume true; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:35:52,993 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} {296#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} #31#return; {294#false} is VALID [2022-02-21 03:35:52,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#false} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {294#false} is VALID [2022-02-21 03:35:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:35:52,994 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:35:52,994 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010983740] [2022-02-21 03:35:52,994 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010983740] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:35:52,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798687544] [2022-02-21 03:35:52,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:35:52,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:35:52,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:35:52,996 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:35:52,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:35:53,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:35:53,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:35:53,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 46 conjunts are in the unsatisfiable core [2022-02-21 03:35:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:35:53,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:35:53,172 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-02-21 03:35:53,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2022-02-21 03:35:58,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#true} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {336#(<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} is VALID [2022-02-21 03:35:58,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#(<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {340#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|)) (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} is VALID [2022-02-21 03:35:58,185 INFO L272 TraceCheckUtils]: 2: Hoare triple {340#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|)) (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {344#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:58,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:58,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {352#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_115 Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_115))) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_115 1)))) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:58,188 INFO L272 TraceCheckUtils]: 5: Hoare triple {352#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_115 Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_115))) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_115 1)))) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {344#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:58,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:58,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(and (= |#memory_int| |old(#memory_int)|) (= |rec_#in~p.base| rec_~p.base) (= |rec_#in~p.offset| rec_~p.offset))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {352#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_115 Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_115))) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_115 1)))) (= |rec_#in~p.offset| rec_~p.offset))} is VALID [2022-02-21 03:35:58,191 INFO L272 TraceCheckUtils]: 8: Hoare triple {352#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_115 Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_115))) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_115 1)))) (= |rec_#in~p.offset| rec_~p.offset))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {344#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-21 03:35:58,192 INFO L290 TraceCheckUtils]: 9: Hoare triple {344#(= |#memory_int| |old(#memory_int)|)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {368#(and (= |rec_#t~mem1| (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-02-21 03:35:58,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(and (= |rec_#t~mem1| (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (= |#memory_int| |old(#memory_int)|))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {372#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-02-21 03:35:58,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {372#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (= |#memory_int| |old(#memory_int)|))} assume true; {372#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-02-21 03:35:58,194 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {372#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (= |#memory_int| |old(#memory_int)|))} {352#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_115 Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_115))) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_115 1)))) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {379#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_115 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_115 1)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_115))))))} is VALID [2022-02-21 03:35:58,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_115 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_115 1)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_115))))))} #res := #t~ret6;havoc #t~ret6; {379#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_115 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_115 1)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_115))))))} is VALID [2022-02-21 03:35:58,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {379#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_115 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_115 1)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_115))))))} assume true; {379#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_115 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_115 1)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_115))))))} is VALID [2022-02-21 03:35:58,684 WARN L284 TraceCheckUtils]: 15: Hoare quadruple {379#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_115 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_115 1)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_115))))))} {352#(and (= |rec_#in~p.base| rec_~p.base) (exists ((v_ArrVal_115 Int)) (and (= |#memory_int| (store |old(#memory_int)| rec_~p.base (store (select |old(#memory_int)| rec_~p.base) rec_~p.offset v_ArrVal_115))) (<= (select (select |old(#memory_int)| rec_~p.base) rec_~p.offset) (+ v_ArrVal_115 1)))) (= |rec_#in~p.offset| rec_~p.offset))} #29#return; {389#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_119 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_119 2)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_119))))))} is UNKNOWN [2022-02-21 03:35:58,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {389#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_119 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_119 2)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_119))))))} #res := #t~ret6;havoc #t~ret6; {389#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_119 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_119 2)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_119))))))} is VALID [2022-02-21 03:35:58,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {389#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_119 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_119 2)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_119))))))} assume true; {389#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_119 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_119 2)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_119))))))} is VALID [2022-02-21 03:35:58,687 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {389#(and (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (exists ((v_ArrVal_119 Int)) (and (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) (+ v_ArrVal_119 2)) (= |#memory_int| (store |old(#memory_int)| |rec_#in~p.base| (store (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset| v_ArrVal_119))))))} {340#(and (<= 0 |ULTIMATE.start_main_~op~0#1.offset|) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|)) (<= |ULTIMATE.start_main_~op~0#1.offset| 0))} #31#return; {294#false} is VALID [2022-02-21 03:35:58,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#false} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {294#false} is VALID [2022-02-21 03:35:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:35:58,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:00,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {294#false} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {294#false} is VALID [2022-02-21 03:36:00,003 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} {296#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} #31#return; {294#false} is VALID [2022-02-21 03:36:00,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} assume true; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:00,004 INFO L290 TraceCheckUtils]: 16: Hoare triple {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} #res := #t~ret6;havoc #t~ret6; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:00,021 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} {417#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) (<= 1 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} #29#return; {326#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1)} is VALID [2022-02-21 03:36:00,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} assume true; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:00,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} #res := #t~ret6;havoc #t~ret6; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:00,024 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} {430#(or (not (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} #29#return; {331#(<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0)} is VALID [2022-02-21 03:36:00,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} assume true; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:00,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {440#(or (<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0) (not (< |rec_#t~mem1| 0)))} 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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {332#(<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0)} is VALID [2022-02-21 03:36:00,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(or (<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0) (not (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0)))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {440#(or (<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0) (not (< |rec_#t~mem1| 0)))} is VALID [2022-02-21 03:36:00,027 INFO L272 TraceCheckUtils]: 8: Hoare triple {430#(or (not (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {444#(or (<= (+ (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) 0) (not (< (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|) 0)))} is VALID [2022-02-21 03:36:00,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {448#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {430#(or (not (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} is VALID [2022-02-21 03:36:00,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(or (<= 1 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {448#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0) (<= 1 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} is VALID [2022-02-21 03:36:00,030 INFO L272 TraceCheckUtils]: 5: Hoare triple {417#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) (<= 1 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {452#(or (<= 1 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 0))} is VALID [2022-02-21 03:36:00,036 INFO L290 TraceCheckUtils]: 4: Hoare triple {456#(or (<= 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {417#(or (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1) (<= 1 (select (select |#memory_int| rec_~p.base) rec_~p.offset)))} is VALID [2022-02-21 03:36:00,037 INFO L290 TraceCheckUtils]: 3: Hoare triple {460#(or (<= 2 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1))} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {456#(or (<= 2 (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1))} is VALID [2022-02-21 03:36:00,038 INFO L272 TraceCheckUtils]: 2: Hoare triple {296#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {460#(or (<= 2 (select (select |#memory_int| |rec_#in~p.base|) |rec_#in~p.offset|)) (<= (select (select |old(#memory_int)| |rec_#in~p.base|) |rec_#in~p.offset|) 1))} is VALID [2022-02-21 03:36:00,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(or (not (< 1 |ULTIMATE.start_main_#t~mem9#1|)) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {296#(<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~op~0#1.base|) |ULTIMATE.start_main_~op~0#1.offset|))} is VALID [2022-02-21 03:36:00,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#true} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {464#(or (not (< 1 |ULTIMATE.start_main_#t~mem9#1|)) (<= 2 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)))} is VALID [2022-02-21 03:36:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:00,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798687544] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:00,042 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:00,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 14] total 27 [2022-02-21 03:36:00,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432641594] [2022-02-21 03:36:00,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:00,056 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:36:00,056 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:00,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-21 03:36:00,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=608, Unknown=5, NotChecked=0, Total=756 [2022-02-21 03:36:00,057 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 6 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:36:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:01,628 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:36:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:36:01,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 28 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 6 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2022-02-21 03:36:02,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:02,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2022-02-21 03:36:02,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:02,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2022-02-21 03:36:02,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:36:02,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 03:36:02,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-02-21 03:36:02,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:02,255 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:36:02,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-02-21 03:36:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:36:02,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:02,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 22 transitions. Second operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:36:02,257 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 22 transitions. Second operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:36:02,257 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:36:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:02,258 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:36:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:36:02,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:02,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:02,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 20 states and 22 transitions. [2022-02-21 03:36:02,259 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 20 states and 22 transitions. [2022-02-21 03:36:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:02,263 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:36:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:36:02,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:02,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:02,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:02,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:02,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-21 03:36:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-02-21 03:36:02,265 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:36:02,266 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:36:02,266 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:02,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:36:02,269 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2022-02-21 03:36:02,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:02,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:02,270 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:02,270 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:02,270 INFO L791 eck$LassoCheckResult]: Stem: 491#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 492#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; 498#L23-3 [2022-02-21 03:36:02,270 INFO L793 eck$LassoCheckResult]: Loop: 498#L23-3 call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 500#L23-1 assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); 494#L26 call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);< 499#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 493#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 495#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 499#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 493#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 495#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 499#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 493#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 495#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 499#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 493#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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 496#recFINAL assume true; 501#recEXIT >#29#return; 502#L17-1 #res := #t~ret6;havoc #t~ret6; 503#recFINAL assume true; 510#recEXIT >#29#return; 509#L17-1 #res := #t~ret6;havoc #t~ret6; 508#recFINAL assume true; 507#recEXIT >#29#return; 505#L17-1 #res := #t~ret6;havoc #t~ret6; 506#recFINAL assume true; 504#recEXIT >#31#return; 497#L26-1 call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; 498#L23-3 [2022-02-21 03:36:02,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2022-02-21 03:36:02,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:02,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448256296] [2022-02-21 03:36:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:02,286 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:02,293 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:02,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2022-02-21 03:36:02,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:02,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449096195] [2022-02-21 03:36:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:02,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:02,327 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:02,355 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:02,356 INFO L85 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2022-02-21 03:36:02,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:02,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093248404] [2022-02-21 03:36:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:02,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:02,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:02,429 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:07,424 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:07,425 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:07,425 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:07,425 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:07,425 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:07,425 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:07,425 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:07,425 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:07,425 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2.i_Iteration4_Lasso [2022-02-21 03:36:07,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:07,426 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:07,442 INFO L141 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,640 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:07,641 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:36:07,643 INFO L141 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,645 INFO L141 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,647 INFO L141 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,649 INFO L141 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,651 INFO L141 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,653 INFO L141 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,655 INFO L141 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,657 INFO L141 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,659 INFO L141 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,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:36:07,663 INFO L141 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,664 INFO L141 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:08,231 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:08,234 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:08,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:08,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:08,284 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:36:08,285 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:36:08,289 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:08,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:08,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:08,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:08,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:08,302 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:08,302 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:08,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:08,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:36:08,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:08,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:08,338 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:36:08,339 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:36:08,340 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:08,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:08,346 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:08,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:08,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:08,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:08,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:08,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:08,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:08,368 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:36:08,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:08,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:08,370 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:36:08,371 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:36:08,373 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:08,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:08,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:08,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:08,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:08,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:08,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:08,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:08,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:36:08,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:08,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:08,407 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:36:08,408 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:36:08,409 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:08,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:08,415 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:36:08,415 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-02-21 03:36:08,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:08,691 INFO L401 nArgumentSynthesizer]: We have 608 Motzkin's Theorem applications. [2022-02-21 03:36:08,691 INFO L402 nArgumentSynthesizer]: A total of 32 supporting invariants were added. [2022-02-21 03:36:09,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:09,337 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:36:09,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:09,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:09,339 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:36:09,340 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:36:09,341 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:09,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:09,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:09,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:09,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:09,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:09,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:09,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:09,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:09,379 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:36:09,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:09,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:09,380 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:36:09,382 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:36:09,383 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:09,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:09,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:09,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:09,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:09,391 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:09,391 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:09,399 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:09,419 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:36:09,419 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-02-21 03:36:09,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:09,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:09,422 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:36:09,423 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:36:09,424 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:09,445 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:09,445 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:09,446 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0#1.base) ULTIMATE.start_main_~ip~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0#1.base) ULTIMATE.start_main_~ip~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:36:09,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:36:09,476 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:36:09,481 INFO L390 LassoCheck]: Loop: "call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);" "call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4);" "assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5;" "call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);"< "~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0;" "assume true;" >"#29#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#29#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#29#return;" "#res := #t~ret6;havoc #t~ret6;" "assume true;" >"#31#return;" "call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1;" [2022-02-21 03:36:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:09,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:09,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:09,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {560#unseeded} is VALID [2022-02-21 03:36:09,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; {560#unseeded} is VALID [2022-02-21 03:36:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:09,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-21 03:36:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:09,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:09,755 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:36:09,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:36:09,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:09,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:36:10,305 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:36:10,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {586#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} is VALID [2022-02-21 03:36:10,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {586#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {590#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:10,651 INFO L272 TraceCheckUtils]: 2: Hoare triple {590#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,653 INFO L272 TraceCheckUtils]: 5: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,654 INFO L272 TraceCheckUtils]: 8: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,655 INFO L272 TraceCheckUtils]: 11: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {594#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:10,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {594#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {625#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {625#(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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,659 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {594#(<= |old(oldRank0)| oldRank0)} #29#return; {636#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:10,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {636#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,661 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {594#(<= |old(oldRank0)| oldRank0)} #29#return; {636#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:10,661 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,672 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {594#(<= |old(oldRank0)| oldRank0)} #29#return; {636#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:10,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {636#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:10,675 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {629#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {590#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} #31#return; {664#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:10,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {664#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {578#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))))} is VALID [2022-02-21 03:36:10,676 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-21 03:36:10,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:10,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 10 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:10,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:10,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,691 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2022-02-21 03:36:10,692 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:10,822 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 37 states and 51 transitions. Complement of second has 15 states. [2022-02-21 03:36:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:10,822 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:10,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:10,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:10,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:10,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:10,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:10,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:10,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2022-02-21 03:36:10,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-02-21 03:36:10,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:10,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:10,826 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:10,829 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:10,830 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:10,831 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:10,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:10,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:10,831 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:10,831 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 51 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:10,835 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2022-02-21 03:36:10,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:10,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:10,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:10,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:10,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:10,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:10,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:10,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 37 letters. Loop has 37 letters. [2022-02-21 03:36:10,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:10,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:10,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 20 letters. Loop has 20 letters. [2022-02-21 03:36:10,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:10,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:10,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 6 letters. Loop has 6 letters. [2022-02-21 03:36:10,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:10,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:10,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 5 letters. Loop has 3 letters. [2022-02-21 03:36:10,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:10,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:10,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 6 letters. Loop has 3 letters. [2022-02-21 03:36:10,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:10,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:10,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 7 letters. Loop has 3 letters. [2022-02-21 03:36:10,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:10,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:10,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:10,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:10,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:10,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 26 letters. [2022-02-21 03:36:10,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:10,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:10,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 4 letters. Loop has 26 letters. [2022-02-21 03:36:10,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:10,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:10,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:10,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:10,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:10,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 10 letters. Loop has 3 letters. [2022-02-21 03:36:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:10,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:10,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:10,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:10,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 31 letters. Loop has 3 letters. [2022-02-21 03:36:10,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:10,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:10,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:10,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:10,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:10,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 33 letters. Loop has 3 letters. [2022-02-21 03:36:10,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:10,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:10,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 28 letters. Loop has 26 letters. [2022-02-21 03:36:10,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:10,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:10,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 29 letters. Loop has 26 letters. [2022-02-21 03:36:10,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:10,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:10,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 30 letters. Loop has 26 letters. [2022-02-21 03:36:10,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:10,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:10,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,862 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2022-02-21 03:36:10,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:10,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:10,863 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:10,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:10,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:10,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {560#unseeded} is VALID [2022-02-21 03:36:10,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; {560#unseeded} is VALID [2022-02-21 03:36:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:10,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-21 03:36:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:10,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:11,041 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:36:11,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:36:11,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:11,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:36:11,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {733#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} is VALID [2022-02-21 03:36:11,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {737#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:11,845 INFO L272 TraceCheckUtils]: 2: Hoare triple {737#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,845 INFO L290 TraceCheckUtils]: 3: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,846 INFO L272 TraceCheckUtils]: 5: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,847 INFO L272 TraceCheckUtils]: 8: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,852 INFO L272 TraceCheckUtils]: 11: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {741#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:11,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {741#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {772#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#(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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,855 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {741#(<= |old(oldRank0)| oldRank0)} #29#return; {783#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:11,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {783#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,858 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {741#(<= |old(oldRank0)| oldRank0)} #29#return; {783#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:11,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {783#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,861 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {741#(<= |old(oldRank0)| oldRank0)} #29#return; {783#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:11,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {783#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:11,863 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {776#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {737#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} #31#return; {811#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:11,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {811#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {578#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))))} is VALID [2022-02-21 03:36:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-21 03:36:11,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:11,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 10 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:11,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:11,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,875 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2022-02-21 03:36:11,876 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:11,924 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 37 states and 51 transitions. Complement of second has 15 states. [2022-02-21 03:36:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:11,925 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:11,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:11,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:11,926 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:11,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:11,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2022-02-21 03:36:11,927 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-02-21 03:36:11,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:11,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:11,928 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:11,928 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:11,928 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:11,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:11,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:11,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:11,929 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:11,929 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 51 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:11,931 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2022-02-21 03:36:11,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:11,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:11,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:11,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:11,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:11,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 37 letters. Loop has 37 letters. [2022-02-21 03:36:11,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:11,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:11,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 20 letters. Loop has 20 letters. [2022-02-21 03:36:11,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:11,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:11,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 6 letters. Loop has 6 letters. [2022-02-21 03:36:11,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:11,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:11,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 5 letters. Loop has 3 letters. [2022-02-21 03:36:11,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:11,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:11,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 6 letters. Loop has 3 letters. [2022-02-21 03:36:11,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:11,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:11,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 7 letters. Loop has 3 letters. [2022-02-21 03:36:11,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:11,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:11,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:11,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:11,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:11,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 26 letters. [2022-02-21 03:36:11,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:11,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:11,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 4 letters. Loop has 26 letters. [2022-02-21 03:36:11,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:11,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:11,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:11,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:11,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:11,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:11,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:11,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 10 letters. Loop has 3 letters. [2022-02-21 03:36:11,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:11,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:11,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:11,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:11,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:11,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:11,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:11,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 28 letters. Loop has 26 letters. [2022-02-21 03:36:11,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:11,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:11,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 29 letters. Loop has 26 letters. [2022-02-21 03:36:11,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:11,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:11,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 30 letters. Loop has 26 letters. [2022-02-21 03:36:11,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:11,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:11,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,951 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2022-02-21 03:36:11,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:11,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:11,952 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:11,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:11,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {560#unseeded} is VALID [2022-02-21 03:36:11,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; {560#unseeded} is VALID [2022-02-21 03:36:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:12,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-21 03:36:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:12,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:12,114 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:36:12,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:36:12,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:12,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:36:12,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {880#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} is VALID [2022-02-21 03:36:12,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {880#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {884#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:12,840 INFO L272 TraceCheckUtils]: 2: Hoare triple {884#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {888#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:12,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {888#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,842 INFO L272 TraceCheckUtils]: 5: Hoare triple {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {888#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:12,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {888#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,843 INFO L272 TraceCheckUtils]: 8: Hoare triple {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {888#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:12,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {888#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {888#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:12,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {888#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {888#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:12,844 INFO L272 TraceCheckUtils]: 11: Hoare triple {888#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {888#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:12,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {888#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {920#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {920#(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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,846 INFO L290 TraceCheckUtils]: 14: Hoare triple {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,847 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {888#(<= |old(oldRank0)| oldRank0)} #29#return; {931#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:12,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {931#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,850 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} #29#return; {931#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:12,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {931#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,852 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {892#(and (= |rec_#in~p.base| rec_~p.base) (<= |old(oldRank0)| oldRank0))} #29#return; {931#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:12,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {931#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:12,859 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {924#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {884#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} #31#return; {959#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:12,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {959#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {578#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))))} is VALID [2022-02-21 03:36:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-02-21 03:36:12,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:12,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 13 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:12,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:12,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:12,870 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2022-02-21 03:36:12,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:13,002 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Result 37 states and 51 transitions. Complement of second has 19 states. [2022-02-21 03:36:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:13,002 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:13,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:13,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:13,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:13,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:13,004 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:13,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:13,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2022-02-21 03:36:13,005 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-02-21 03:36:13,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:13,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:13,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:13,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:13,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:13,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:13,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 21 transitions. cyclomatic complexity: 16 [2022-02-21 03:36:13,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:13,007 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:13,007 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 51 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:13,009 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2022-02-21 03:36:13,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:13,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:13,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:13,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:13,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:13,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:13,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:13,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:13,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:13,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:13,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:13,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:13,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:13,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:13,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:13,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:13,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:13,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:13,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:13,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:13,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:13,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:13,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:13,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:13,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:13,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:13,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:13,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:13,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:13,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:13,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:13,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:13,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:13,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:13,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:13,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:13,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:13,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:13,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:13,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:13,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:13,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:13,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:13,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:13,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:13,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:13,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:13,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:13,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:13,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:13,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:13,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:13,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:13,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:13,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:13,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:13,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:13,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:13,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:13,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:13,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:13,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,029 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:36:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-02-21 03:36:13,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:13,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:13,031 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:13,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:13,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {560#unseeded} is VALID [2022-02-21 03:36:13,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; {560#unseeded} is VALID [2022-02-21 03:36:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-21 03:36:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:13,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:13,172 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:36:13,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:36:13,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:36:13,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-02-21 03:36:14,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {1034#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} is VALID [2022-02-21 03:36:14,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1034#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {1038#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:14,023 INFO L272 TraceCheckUtils]: 2: Hoare triple {1038#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,024 INFO L272 TraceCheckUtils]: 5: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,026 INFO L272 TraceCheckUtils]: 8: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {1042#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:14,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1073#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {1073#(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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,031 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {1042#(<= |old(oldRank0)| oldRank0)} #29#return; {1084#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:14,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {1084#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,034 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {1042#(<= |old(oldRank0)| oldRank0)} #29#return; {1084#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:14,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {1084#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,036 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {1042#(<= |old(oldRank0)| oldRank0)} #29#return; {1084#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:14,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {1084#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:14,039 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1077#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {1038#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} #31#return; {1112#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:14,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {1112#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {578#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))))} is VALID [2022-02-21 03:36:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-21 03:36:14,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:14,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 10 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:14,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:14,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,051 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2022-02-21 03:36:14,051 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:14,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 37 states and 51 transitions. Complement of second has 15 states. [2022-02-21 03:36:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:14,131 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:14,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:14,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:14,132 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:14,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:14,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 51 transitions. [2022-02-21 03:36:14,132 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-02-21 03:36:14,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:14,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:14,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:14,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:14,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:14,134 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:14,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 21 transitions. cyclomatic complexity: 17 [2022-02-21 03:36:14,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:14,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:14,134 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 51 transitions. cyclomatic complexity: 18 [2022-02-21 03:36:14,136 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2022-02-21 03:36:14,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:14,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:14,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:14,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:14,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:14,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:14,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:14,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 37 letters. Loop has 37 letters. [2022-02-21 03:36:14,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:36:14,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:14,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 20 letters. Loop has 20 letters. [2022-02-21 03:36:14,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:14,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:14,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 6 letters. Loop has 6 letters. [2022-02-21 03:36:14,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:14,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:14,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 5 letters. Loop has 3 letters. [2022-02-21 03:36:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 6 letters. Loop has 3 letters. [2022-02-21 03:36:14,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 7 letters. Loop has 3 letters. [2022-02-21 03:36:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:14,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:14,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:14,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:14,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 26 letters. [2022-02-21 03:36:14,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:14,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:14,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 4 letters. Loop has 26 letters. [2022-02-21 03:36:14,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:14,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:14,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:14,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:36:14,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:14,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 10 letters. Loop has 3 letters. [2022-02-21 03:36:14,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:36:14,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:14,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:14,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:14,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:14,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 31 letters. Loop has 3 letters. [2022-02-21 03:36:14,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 31 letters. Loop has 3 letters. [2022-02-21 03:36:14,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:14,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 3 letters. [2022-02-21 03:36:14,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 32 letters. Loop has 3 letters. [2022-02-21 03:36:14,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:14,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 33 letters. Loop has 3 letters. [2022-02-21 03:36:14,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 33 letters. Loop has 3 letters. [2022-02-21 03:36:14,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:14,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 28 letters. Loop has 26 letters. [2022-02-21 03:36:14,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:14,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:14,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 29 letters. Loop has 26 letters. [2022-02-21 03:36:14,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 29 letters. Loop has 26 letters. [2022-02-21 03:36:14,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:14,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 30 letters. Loop has 26 letters. [2022-02-21 03:36:14,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 30 letters. Loop has 26 letters. [2022-02-21 03:36:14,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 51 transitions. cyclomatic complexity: 18 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:14,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,154 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:14,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-21 03:36:14,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:14,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:14,156 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:14,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:14,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {560#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {560#unseeded} is VALID [2022-02-21 03:36:14,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {560#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~nondet8#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1, main_#t~mem13#1, main_#t~ret12#1, main_~op~0#1.base, main_~op~0#1.offset, main_#t~mem9#1, main_~ip~0#1.base, main_~ip~0#1.offset;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(4);main_~ip~0#1.base, main_~ip~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_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~nondet8#1; {560#unseeded} is VALID [2022-02-21 03:36:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-21 03:36:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:14,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:14,297 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 37 treesize of output 25 [2022-02-21 03:36:14,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 16 [2022-02-21 03:36:14,388 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:36:14,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:36:15,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))} call main_#t~mem9#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {1181#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} is VALID [2022-02-21 03:36:15,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#(and (<= |ULTIMATE.start_main_#t~mem9#1| (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~ip~0#1.base|) 1))} assume !!(main_#t~mem9#1 > 1);havoc main_#t~mem9#1;call main_#t~malloc10#1.base, main_#t~malloc10#1.offset := #Ultimate.allocOnHeap(4);main_~op~0#1.base, main_~op~0#1.offset := main_#t~malloc10#1.base, main_#t~malloc10#1.offset;havoc main_#t~malloc10#1.base, main_#t~malloc10#1.offset;call main_#t~mem11#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4);call write~int(main_#t~mem11#1, main_~op~0#1.base, main_~op~0#1.offset, 4);havoc main_#t~mem11#1;call main_#t~mem13#1 := read~int(main_~ip~0#1.base, main_~ip~0#1.offset, 4); {1185#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:15,264 INFO L272 TraceCheckUtils]: 2: Hoare triple {1185#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call main_#t~ret12#1 := rec(main_~op~0#1.base, main_~op~0#1.offset, main_~ip~0#1.base, main_~ip~0#1.offset); {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,265 INFO L272 TraceCheckUtils]: 5: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,267 INFO L272 TraceCheckUtils]: 8: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;havoc #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,269 INFO L272 TraceCheckUtils]: 11: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset); {1189#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:36:15,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {1189#(<= |old(oldRank0)| oldRank0)} ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); {1220#(and (<= (select (select |#memory_int| rec_~p.base) rec_~p.offset) |rec_#t~mem1|) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {1220#(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);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,272 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {1189#(<= |old(oldRank0)| oldRank0)} #29#return; {1231#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:15,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {1231#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,275 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {1189#(<= |old(oldRank0)| oldRank0)} #29#return; {1231#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:15,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {1231#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,278 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {1189#(<= |old(oldRank0)| oldRank0)} #29#return; {1231#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} is VALID [2022-02-21 03:36:15,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {1231#(and (<= |old(oldRank0)| oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |rec_#t~ret6| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))))} #res := #t~ret6;havoc #t~ret6; {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} assume true; {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:36:15,281 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1224#(and (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (<= |rec_#res| (select (select |#memory_int| rec_~p.base) rec_~p.offset)) (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0))) (<= |old(oldRank0)| oldRank0))} {1185#(and (not (= |ULTIMATE.start_main_~op~0#1.base| |ULTIMATE.start_main_~ip~0#1.base|)) (< 1 oldRank0) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} #31#return; {1259#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} is VALID [2022-02-21 03:36:15,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {1259#(and (< 1 oldRank0) (exists ((rec_~p.offset Int) (rec_~p.base Int)) (and (< (select (select |#memory_int| rec_~p.base) rec_~p.offset) 0) (<= |ULTIMATE.start_main_#t~ret12#1| (select (select |#memory_int| rec_~p.base) rec_~p.offset)))) (<= |ULTIMATE.start_main_#t~mem13#1| oldRank0))} call write~int(main_#t~mem13#1 + main_#t~ret12#1, main_~ip~0#1.base, main_~ip~0#1.offset, 4);havoc main_#t~mem13#1;havoc main_#t~ret12#1; {578#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~ip~0#1.base|) |ULTIMATE.start_main_~ip~0#1.offset|))))} is VALID [2022-02-21 03:36:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-21 03:36:15,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:15,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 10 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:15,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:15,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,295 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2022-02-21 03:36:15,296 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:15,484 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,485 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,487 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,487 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,488 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,488 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,489 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,489 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,494 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,495 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,497 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,498 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,498 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,499 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,499 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,500 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,501 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,501 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,502 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,502 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,503 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,504 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,522 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,523 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,524 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,524 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,524 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,525 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,525 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,526 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,527 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,527 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,530 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,530 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,531 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,532 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,533 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,533 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,534 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,534 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,534 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,535 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,535 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,535 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,536 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,536 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,538 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,538 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,539 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,540 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,541 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,541 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,541 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,542 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,542 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,554 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,556 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,560 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,561 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,561 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,561 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,562 WARN L278 uchiComplementFKVNwa]: big16 [2022-02-21 03:36:15,563 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,563 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,564 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,564 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,565 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,566 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,566 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:36:15,726 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 1050 states and 3482 transitions. Complement of second has 1008 states 13 powerset states995 rank states. The highest rank that occured is 9 [2022-02-21 03:36:15,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:15,726 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2022-02-21 03:36:15,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:15,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:15,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:15,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:15,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:15,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:15,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1050 states and 3482 transitions. [2022-02-21 03:36:15,736 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 827 [2022-02-21 03:36:15,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:15,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:15,738 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 22 transitions. cyclomatic complexity: 4 [2022-02-21 03:36:15,738 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:15,738 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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:15,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:15,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 47 transitions. cyclomatic complexity: 43 [2022-02-21 03:36:15,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:15,740 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:15,740 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 [2022-02-21 03:36:15,804 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 287 examples of accepted words. [2022-02-21 03:36:15,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:15,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:15,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:15,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:17,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:17,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 4 letters. Loop has 26 letters. [2022-02-21 03:36:17,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:17,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 1050 letters. Loop has 1050 letters. [2022-02-21 03:36:17,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 1050 letters. Loop has 1050 letters. [2022-02-21 03:36:17,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 1050 letters. Loop has 1050 letters. [2022-02-21 03:36:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 20 letters. Loop has 20 letters. [2022-02-21 03:36:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:36:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 7 letters. Loop has 7 letters. [2022-02-21 03:36:17,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:17,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:17,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 5 letters. Loop has 3 letters. [2022-02-21 03:36:17,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:17,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:17,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 6 letters. Loop has 3 letters. [2022-02-21 03:36:17,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:17,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 7 letters. Loop has 3 letters. [2022-02-21 03:36:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:18,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:18,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:18,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:18,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:18,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 2 letters. Loop has 26 letters. [2022-02-21 03:36:18,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:18,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 2 letters. Loop has 26 letters. [2022-02-21 03:36:19,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:19,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 26 letters. [2022-02-21 03:36:19,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:19,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 3 letters. Loop has 26 letters. [2022-02-21 03:36:20,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:20,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:20,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:20,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 4 letters. Loop has 26 letters. [2022-02-21 03:36:20,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:20,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 4 letters. Loop has 26 letters. [2022-02-21 03:36:20,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:20,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:20,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:20,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:20,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:20,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 28 letters. Loop has 26 letters. [2022-02-21 03:36:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 28 letters. Loop has 26 letters. [2022-02-21 03:36:22,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:22,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 27 letters. Loop has 26 letters. [2022-02-21 03:36:22,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:22,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 27 letters. Loop has 26 letters. [2022-02-21 03:36:23,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 22 transitions. cyclomatic complexity: 4 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:36:23,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 7 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 6 letters. [2022-02-21 03:36:23,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:23,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1050 states and 3482 transitions. cyclomatic complexity: 2440 Stem has 9 letters. Loop has 6 letters.