./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca.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-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca.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 36020926b2e6d9c0fb54830342005e347c0f1376e21c9ccaa0e5acb205202e3a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:30:39,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:30:39,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:30:39,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:30:39,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:30:39,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:30:39,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:30:39,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:30:39,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:30:39,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:30:39,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:30:39,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:30:39,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:30:39,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:30:40,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:30:40,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:30:40,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:30:40,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:30:40,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:30:40,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:30:40,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:30:40,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:30:40,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:30:40,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:30:40,020 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:30:40,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:30:40,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:30:40,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:30:40,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:30:40,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:30:40,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:30:40,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:30:40,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:30:40,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:30:40,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:30:40,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:30:40,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:30:40,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:30:40,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:30:40,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:30:40,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:30:40,035 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:30:40,054 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:30:40,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:30:40,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:30:40,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:30:40,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:30:40,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:30:40,057 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:30:40,057 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:30:40,057 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:30:40,057 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:30:40,058 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:30:40,058 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:30:40,058 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:30:40,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:30:40,058 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:30:40,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:30:40,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:30:40,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:30:40,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:30:40,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:30:40,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:30:40,059 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:30:40,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:30:40,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:30:40,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:30:40,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:30:40,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:30:40,061 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:30:40,062 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:30:40,062 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 -> 36020926b2e6d9c0fb54830342005e347c0f1376e21c9ccaa0e5acb205202e3a [2022-02-21 03:30:40,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:30:40,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:30:40,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:30:40,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:30:40,301 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:30:40,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca.i [2022-02-21 03:30:40,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539859198/c30f48177e014a13b60805da06b76853/FLAGa4447c3f8 [2022-02-21 03:30:40,771 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:30:40,771 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca.i [2022-02-21 03:30:40,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539859198/c30f48177e014a13b60805da06b76853/FLAGa4447c3f8 [2022-02-21 03:30:40,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/539859198/c30f48177e014a13b60805da06b76853 [2022-02-21 03:30:40,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:30:40,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:30:40,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:40,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:30:40,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:30:40,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:40" (1/1) ... [2022-02-21 03:30:40,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761a5e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:40, skipping insertion in model container [2022-02-21 03:30:40,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:30:40" (1/1) ... [2022-02-21 03:30:40,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:30:40,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:30:41,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:41,015 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:30:41,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:30:41,068 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:30:41,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41 WrapperNode [2022-02-21 03:30:41,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:30:41,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:41,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:30:41,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:30:41,089 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:30:41" (1/1) ... [2022-02-21 03:30:41,101 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:30:41" (1/1) ... [2022-02-21 03:30:41,126 INFO L137 Inliner]: procedures = 110, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 59 [2022-02-21 03:30:41,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:30:41,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:30:41,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:30:41,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:30:41,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (1/1) ... [2022-02-21 03:30:41,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (1/1) ... [2022-02-21 03:30:41,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (1/1) ... [2022-02-21 03:30:41,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (1/1) ... [2022-02-21 03:30:41,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (1/1) ... [2022-02-21 03:30:41,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (1/1) ... [2022-02-21 03:30:41,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (1/1) ... [2022-02-21 03:30:41,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:30:41,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:30:41,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:30:41,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:30:41,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (1/1) ... [2022-02-21 03:30:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:41,192 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:30:41,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:30:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:30:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:30:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:30:41,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:30:41,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:30:41,219 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:30:41,295 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:30:41,296 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:30:41,492 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:30:41,496 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:30:41,497 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:30:41,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:41 BoogieIcfgContainer [2022-02-21 03:30:41,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:30:41,499 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:30:41,499 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:30:41,501 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:30:41,502 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:41,502 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:30:40" (1/3) ... [2022-02-21 03:30:41,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ef561d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:41, skipping insertion in model container [2022-02-21 03:30:41,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:41,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:30:41" (2/3) ... [2022-02-21 03:30:41,503 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1ef561d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:30:41, skipping insertion in model container [2022-02-21 03:30:41,503 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:30:41,503 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:30:41" (3/3) ... [2022-02-21 03:30:41,505 INFO L388 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca.i [2022-02-21 03:30:41,542 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:30:41,542 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:30:41,542 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:30:41,542 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:30:41,542 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:30:41,543 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:30:41,543 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:30:41,543 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:30:41,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:30:41,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:41,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:41,595 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:41,595 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:41,595 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:30:41,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:41,597 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:30:41,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:41,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:41,597 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:30:41,598 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:41,602 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~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; 11#L554-2true [2022-02-21 03:30:41,602 INFO L793 eck$LassoCheckResult]: Loop: 11#L554-2true call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 6#L551-1true assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 7#L551-3true main_#t~short9#1 := main_#t~short7#1; 13#L551-4true assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 10#L551-6true assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 9#L552true assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; 11#L554-2true [2022-02-21 03:30:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:30:41,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:41,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78503630] [2022-02-21 03:30:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:41,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,732 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,773 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2022-02-21 03:30:41,775 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:41,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732986179] [2022-02-21 03:30:41,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:41,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,815 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,836 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:41,840 INFO L85 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2022-02-21 03:30:41,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:41,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973825961] [2022-02-21 03:30:41,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:41,910 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:42,478 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:42,479 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:42,479 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:42,479 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:42,479 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:42,479 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:42,479 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:42,480 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:42,480 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration1_Lasso [2022-02-21 03:30:42,480 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:42,480 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:42,494 INFO L141 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:30:42,499 INFO L141 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:30:42,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:42,508 INFO L141 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:30:42,510 INFO L141 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:30:42,513 INFO L141 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:30:42,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:42,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:42,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:42,523 INFO L141 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:30:42,928 INFO L141 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:30:42,932 INFO L141 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:30:42,934 INFO L141 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:30:42,935 INFO L141 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:30:42,937 INFO L141 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:30:42,939 INFO L141 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:30:42,941 INFO L141 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:30:42,943 INFO L141 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:30:42,945 INFO L141 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:30:43,442 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:43,447 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:43,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:43,456 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:30:43,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:30:43,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:30:43,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:43,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:30:43,507 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:30:43,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,556 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:30:43,556 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:30:43,558 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:30:43,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,587 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:30:43,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:30:43,590 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:30:43,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,613 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:30:43,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,614 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:30:43,615 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:30:43,616 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:30:43,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,658 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:30:43,659 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:30:43,661 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:30:43,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,710 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:30:43,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,711 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:30:43,712 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:30:43,714 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:30:43,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:30:43,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,736 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:30:43,737 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:30:43,738 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:30:43,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,768 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:30:43,768 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:30:43,770 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:30:43,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:30:43,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,801 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:43,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:30:43,804 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:30:43,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,826 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,844 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:43,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:30:43,846 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:30:43,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,855 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:43,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:30:43,881 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:30:43,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:43,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:43,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,937 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:43,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:30:43,939 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:30:43,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:43,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:43,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:43,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:43,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:43,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:43,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:43,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:43,982 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:43,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:30:43,985 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:30:43,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:43,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:43,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:43,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:44,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:44,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:44,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:44,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:44,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:44,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:44,034 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:44,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:30:44,037 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:30:44,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:44,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:44,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:44,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:44,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:44,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:44,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:44,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:44,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:44,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:44,092 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:44,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:30:44,094 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:30:44,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:44,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:44,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:44,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:44,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:44,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:44,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:44,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:44,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:44,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:44,152 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:44,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:30:44,154 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:30:44,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:44,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:44,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:44,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:44,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:44,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:44,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:44,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:44,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:30:44,168 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:30:44,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:44,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:44,170 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:44,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:30:44,172 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:44,172 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:30:44,172 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:44,172 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_1 Supporting invariants [] [2022-02-21 03:30:44,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:44,315 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-02-21 03:30:44,319 INFO L390 LassoCheck]: Loop: "call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0;" "main_#t~short9#1 := main_#t~short7#1;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0;" "assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;" [2022-02-21 03:30:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:44,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {23#unseeded} is VALID [2022-02-21 03:30:44,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {23#unseeded} is VALID [2022-02-21 03:30:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:44,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {164#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:30:44,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {168#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} main_#t~short9#1 := main_#t~short7#1; {168#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {168#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {168#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {168#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {168#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:44,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {156#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:44,536 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:30:44,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,575 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:30:44,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:30:44,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,581 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:44,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 79 transitions. Complement of second has 10 states. [2022-02-21 03:30:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:44,686 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:44,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:30:44,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:30:44,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 79 transitions. [2022-02-21 03:30:44,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:44,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,693 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:30:44,695 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:30:44,695 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-02-21 03:30:44,697 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:30:44,697 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 60 states and 79 transitions. cyclomatic complexity: 22 [2022-02-21 03:30:44,700 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:44,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:30:44,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:30:44,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:30:44,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 60 letters. [2022-02-21 03:30:44,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 60 letters. [2022-02-21 03:30:44,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 60 letters. Loop has 60 letters. [2022-02-21 03:30:44,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:44,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:44,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:44,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:30:44,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:30:44,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:30:44,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:44,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:44,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:44,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:30:44,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:30:44,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:30:44,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:30:44,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:30:44,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:30:44,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:30:44,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:30:44,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:30:44,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:30:44,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:30:44,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:30:44,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:44,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:44,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:44,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:44,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:44,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:44,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:44,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:44,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:44,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:44,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:44,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:44,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:44,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:44,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:44,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:44,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:44,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:44,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:44,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:44,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:30:44,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:30:44,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:30:44,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:30:44,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:30:44,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:30:44,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:30:44,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:30:44,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:30:44,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 60 states and 79 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 6 letters. [2022-02-21 03:30:44,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,728 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-02-21 03:30:44,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:30:44,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:30:44,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:30:44,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:44,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. cyclomatic complexity: 22 [2022-02-21 03:30:44,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:44,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 50 transitions. [2022-02-21 03:30:44,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-02-21 03:30:44,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 03:30:44,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-02-21 03:30:44,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:44,767 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-02-21 03:30:44,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-02-21 03:30:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2022-02-21 03:30:44,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:44,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 50 transitions. Second operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,787 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 50 transitions. Second operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,791 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,793 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:44,795 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-02-21 03:30:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2022-02-21 03:30:44,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:44,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:44,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states and 50 transitions. [2022-02-21 03:30:44,796 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states and 50 transitions. [2022-02-21 03:30:44,796 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:44,798 INFO L93 Difference]: Finished difference Result 35 states and 52 transitions. [2022-02-21 03:30:44,798 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-02-21 03:30:44,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:44,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:44,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:44,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 30 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2022-02-21 03:30:44,800 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2022-02-21 03:30:44,800 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2022-02-21 03:30:44,800 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:30:44,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2022-02-21 03:30:44,801 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:44,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,801 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:30:44,801 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:44,802 INFO L791 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 256#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; 271#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 274#L551-1 [2022-02-21 03:30:44,802 INFO L793 eck$LassoCheckResult]: Loop: 274#L551-1 assume !main_#t~short7#1; 268#L551-3 main_#t~short9#1 := main_#t~short7#1; 269#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 272#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 283#L552 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; 280#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 274#L551-1 [2022-02-21 03:30:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,802 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-02-21 03:30:44,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:44,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730978854] [2022-02-21 03:30:44,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:44,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,829 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2022-02-21 03:30:44,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:44,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844551326] [2022-02-21 03:30:44,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:44,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:44,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {415#true} assume !main_#t~short7#1; {417#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-21 03:30:44,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#(not |ULTIMATE.start_main_#t~short7#1|)} main_#t~short9#1 := main_#t~short7#1; {418#(not |ULTIMATE.start_main_#t~short9#1|)} is VALID [2022-02-21 03:30:44,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {418#(not |ULTIMATE.start_main_#t~short9#1|)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {416#false} is VALID [2022-02-21 03:30:44,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {416#false} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {416#false} is VALID [2022-02-21 03:30:44,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {416#false} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {416#false} is VALID [2022-02-21 03:30:44,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#false} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {416#false} is VALID [2022-02-21 03:30:44,885 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:30:44,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:30:44,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844551326] [2022-02-21 03:30:44,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844551326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:30:44,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:30:44,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:30:44,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631266900] [2022-02-21 03:30:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:30:44,888 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:30:44,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:30:44,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:30:44,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:30:44,891 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:30:44,927 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-21 03:30:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:30:44,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:44,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2022-02-21 03:30:44,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:30:44,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2022-02-21 03:30:44,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:30:44,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:30:44,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2022-02-21 03:30:44,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:44,935 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 03:30:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2022-02-21 03:30:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 03:30:44,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:44,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,936 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,936 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,937 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:44,937 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 03:30:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:30:44,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:44,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:44,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 25 transitions. [2022-02-21 03:30:44,938 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states and 25 transitions. [2022-02-21 03:30:44,938 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:44,939 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-21 03:30:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:30:44,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:44,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:44,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:44,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-21 03:30:44,940 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 03:30:44,940 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 03:30:44,940 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:30:44,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:30:44,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:30:44,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:44,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:44,941 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:30:44,941 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:30:44,942 INFO L791 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 455#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; 469#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 463#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 465#L551-3 main_#t~short9#1 := main_#t~short7#1; 467#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 456#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 457#L552 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; 472#L554 [2022-02-21 03:30:44,942 INFO L793 eck$LassoCheckResult]: Loop: 472#L554 assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; 460#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 461#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 474#L551-3 main_#t~short9#1 := main_#t~short7#1; 470#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 471#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 473#L552 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; 472#L554 [2022-02-21 03:30:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2022-02-21 03:30:44,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:44,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338788745] [2022-02-21 03:30:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:44,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,963 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,976 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1175734219, now seen corresponding path program 1 times [2022-02-21 03:30:44,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:44,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251904535] [2022-02-21 03:30:44,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:44,995 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:45,003 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:45,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1517982238, now seen corresponding path program 1 times [2022-02-21 03:30:45,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:45,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279465238] [2022-02-21 03:30:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:45,024 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:45,051 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:45,736 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:45,736 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:45,736 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:45,736 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:45,736 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:45,737 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:45,737 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:45,737 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:45,737 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration3_Lasso [2022-02-21 03:30:45,737 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:45,737 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:45,739 INFO L141 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:30:45,745 INFO L141 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:30:45,747 INFO L141 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:30:45,749 INFO L141 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:30:45,750 INFO L141 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:30:45,752 INFO L141 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:30:46,076 INFO L141 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:30:46,078 INFO L141 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:30:46,080 INFO L141 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:30:46,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:46,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:46,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:46,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:46,091 INFO L141 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:30:46,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:46,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:46,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:46,099 INFO L141 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:30:46,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:46,563 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:46,564 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:46,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:46,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:46,565 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:46,569 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:30:46,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:46,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:46,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:46,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:46,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:46,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:46,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:46,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:30:46,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:46,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:30:46,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:46,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:46,600 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:46,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:30:46,602 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:30:46,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:46,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:46,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:46,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:46,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:46,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:46,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:46,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:46,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:46,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:46,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:46,627 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:46,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:30:46,629 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:30:46,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:46,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:46,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:46,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:46,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:46,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:46,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:46,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:30:46,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:46,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:46,655 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:46,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:30:46,658 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:30:46,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:46,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:46,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:46,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:46,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:46,663 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:46,663 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:46,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:46,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:30:46,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:46,688 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:46,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:30:46,690 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:30:46,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:46,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:46,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:46,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:46,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:46,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:46,713 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:46,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:30:46,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:46,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:46,729 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:46,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:30:46,732 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:30:46,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:46,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:46,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:46,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:46,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:46,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:46,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:46,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-02-21 03:30:46,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:46,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:46,767 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:46,781 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:30:46,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:46,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:46,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:46,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:46,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:46,790 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:46,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:30:46,799 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:46,805 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:30:46,805 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:30:46,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:46,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:46,806 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:46,809 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:46,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:30:46,821 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:46,821 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:46,821 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0#1.base) ULTIMATE.start_main_~y~0#1.offset)_2 Supporting invariants [] [2022-02-21 03:30:46,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:46,932 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2022-02-21 03:30:46,939 INFO L390 LassoCheck]: Loop: "assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1;" "call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0;" "main_#t~short9#1 := main_#t~short7#1;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0;" "assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;" [2022-02-21 03:30:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:46,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:46,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:46,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:47,071 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 98 treesize of output 94 [2022-02-21 03:30:47,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:47,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {568#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {568#unseeded} is VALID [2022-02-21 03:30:47,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} is VALID [2022-02-21 03:30:47,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} is VALID [2022-02-21 03:30:47,212 INFO L290 TraceCheckUtils]: 3: Hoare triple {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} is VALID [2022-02-21 03:30:47,213 INFO L290 TraceCheckUtils]: 4: Hoare triple {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} main_#t~short9#1 := main_#t~short7#1; {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} is VALID [2022-02-21 03:30:47,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} is VALID [2022-02-21 03:30:47,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} is VALID [2022-02-21 03:30:47,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {703#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) unseeded)} is VALID [2022-02-21 03:30:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:47,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:30:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:47,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:47,338 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-02-21 03:30:47,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-21 03:30:47,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {704#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)))} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {733#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:47,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {733#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:47,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {740#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:47,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {740#(and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} main_#t~short9#1 := main_#t~short7#1; {744#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:47,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {748#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:47,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {748#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {748#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:47,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {748#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {706#(and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~y~0#1.base|) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~z~0#1.base|)) (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))))} is VALID [2022-02-21 03:30:47,580 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:30:47,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:47,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:47,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-02-21 03:30:47,601 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,746 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 58 transitions. Complement of second has 12 states. [2022-02-21 03:30:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:47,747 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:47,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:47,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:47,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:47,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:47,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:47,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:47,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 58 transitions. [2022-02-21 03:30:47,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:47,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:47,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:47,749 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 25 transitions. cyclomatic complexity: 6 [2022-02-21 03:30:47,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:30:47,750 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:30:47,751 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:47,751 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 58 transitions. cyclomatic complexity: 14 [2022-02-21 03:30:47,754 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:47,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:47,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:47,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:47,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:47,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:47,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 48 letters. Loop has 48 letters. [2022-02-21 03:30:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 48 letters. [2022-02-21 03:30:47,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 48 letters. Loop has 48 letters. [2022-02-21 03:30:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:30:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:30:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:30:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:47,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:30:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:47,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:47,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:47,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:47,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:47,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:47,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:47,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:47,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:47,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:47,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:47,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:47,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:47,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:47,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:47,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:30:47,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:47,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:47,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:47,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:47,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:47,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:47,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:47,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:47,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:47,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:47,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:47,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:47,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:47,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:47,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:47,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:47,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:47,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:47,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:47,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:47,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:47,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:47,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:47,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:47,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:47,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:47,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:47,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:47,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:47,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:47,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:47,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 58 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:47,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,781 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2022-02-21 03:30:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 7 letters. [2022-02-21 03:30:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:47,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 14 letters. [2022-02-21 03:30:47,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:47,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. cyclomatic complexity: 14 [2022-02-21 03:30:47,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:47,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 52 transitions. [2022-02-21 03:30:47,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-02-21 03:30:47,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 03:30:47,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2022-02-21 03:30:47,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:47,787 INFO L681 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2022-02-21 03:30:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2022-02-21 03:30:47,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2022-02-21 03:30:47,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:47,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 52 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,792 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 52 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,795 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,795 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:47,796 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-02-21 03:30:47,796 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2022-02-21 03:30:47,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:47,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:47,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states and 52 transitions. [2022-02-21 03:30:47,797 INFO L87 Difference]: Start difference. First operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states and 52 transitions. [2022-02-21 03:30:47,797 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:47,806 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-02-21 03:30:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-02-21 03:30:47,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:47,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:47,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:47,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 40 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-02-21 03:30:47,810 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-02-21 03:30:47,810 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-02-21 03:30:47,810 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:30:47,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2022-02-21 03:30:47,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:47,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:47,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:47,813 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:30:47,813 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:47,813 INFO L791 eck$LassoCheckResult]: Stem: 823#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 824#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; 837#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 851#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 856#L551-3 main_#t~short9#1 := main_#t~short7#1; 855#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 854#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 853#L552 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; 852#L554 assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;call main_#t~mem15#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem15#1;call write~int(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1; 829#L554-2 [2022-02-21 03:30:47,813 INFO L793 eck$LassoCheckResult]: Loop: 829#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 830#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 833#L551-3 main_#t~short9#1 := main_#t~short7#1; 835#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 838#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 840#L552 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; 829#L554-2 [2022-02-21 03:30:47,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1211450581, now seen corresponding path program 1 times [2022-02-21 03:30:47,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:47,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889073598] [2022-02-21 03:30:47,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:47,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:47,855 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2022-02-21 03:30:47,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:47,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506717413] [2022-02-21 03:30:47,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:47,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:47,866 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:47,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:47,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1001977698, now seen corresponding path program 1 times [2022-02-21 03:30:47,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:47,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019049385] [2022-02-21 03:30:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:47,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:47,902 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:48,559 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:48,559 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:48,559 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:48,559 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:48,559 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:48,559 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:48,559 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:48,559 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:48,560 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration4_Lasso [2022-02-21 03:30:48,560 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:48,560 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:48,562 INFO L141 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:30:48,577 INFO L141 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:30:48,579 INFO L141 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:30:48,582 INFO L141 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:30:48,584 INFO L141 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:30:48,586 INFO L141 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:30:48,587 INFO L141 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:30:48,589 INFO L141 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:30:48,591 INFO L141 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:30:48,592 INFO L141 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:30:48,594 INFO L141 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:30:48,596 INFO L141 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:30:48,984 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:48,986 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:48,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:48,996 INFO L141 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:30:48,998 INFO L141 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:30:49,000 INFO L141 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:30:49,001 INFO L141 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:30:49,003 INFO L141 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:30:49,005 INFO L141 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:30:49,006 INFO L141 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:30:49,463 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:49,463 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:49,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,465 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:30:49,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:49,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:49,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:49,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,496 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:30:49,498 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:30:49,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:49,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:49,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:49,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:30:49,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,521 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:30:49,523 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:30:49,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:49,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:49,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:30:49,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,548 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:30:49,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:49,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:49,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:49,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:49,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:30:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,575 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:30:49,577 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:30:49,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:49,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:49,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:49,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:30:49,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,606 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:30:49,608 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:30:49,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:49,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:49,614 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:49,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,632 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:30:49,634 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:30:49,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:49,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:49,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:49,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:30:49,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,656 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:30:49,659 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:30:49,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:49,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:49,685 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,716 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,724 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:30:49,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:30:49,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:49,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:49,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:49,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,748 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:30:49,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:49,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:49,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,755 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:30:49,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,756 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:30:49,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:49,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:30:49,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,773 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:30:49,775 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:30:49,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:49,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,780 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:49,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:49,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,799 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:30:49,801 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:30:49,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:49,808 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:49,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,847 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:30:49,851 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:30:49,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:49,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:49,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,876 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:30:49,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:49,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:49,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:49,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,909 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:30:49,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:49,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,921 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:49,921 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:49,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:30:49,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,943 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:30:49,946 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:30:49,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:49,957 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:49,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:49,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:49,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:49,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:49,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:49,990 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:49,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:30:49,993 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:30:49,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:49,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:49,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:49,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:50,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:50,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:50,017 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:50,021 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:30:50,021 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:30:50,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:50,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:50,022 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:50,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:30:50,024 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:50,030 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:50,030 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:50,030 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_3 Supporting invariants [] [2022-02-21 03:30:50,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:50,123 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-02-21 03:30:50,126 INFO L390 LassoCheck]: Loop: "call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0;" "main_#t~short9#1 := main_#t~short7#1;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0;" "assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;" [2022-02-21 03:30:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:50,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {1030#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1030#unseeded} is VALID [2022-02-21 03:30:50,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {1030#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1030#unseeded} is VALID [2022-02-21 03:30:50,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {1030#unseeded} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1030#unseeded} is VALID [2022-02-21 03:30:50,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {1030#unseeded} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1030#unseeded} is VALID [2022-02-21 03:30:50,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {1030#unseeded} main_#t~short9#1 := main_#t~short7#1; {1030#unseeded} is VALID [2022-02-21 03:30:50,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {1030#unseeded} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1030#unseeded} is VALID [2022-02-21 03:30:50,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#unseeded} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1030#unseeded} is VALID [2022-02-21 03:30:50,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#unseeded} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1030#unseeded} is VALID [2022-02-21 03:30:50,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {1030#unseeded} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;call main_#t~mem15#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem15#1;call write~int(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1; {1030#unseeded} is VALID [2022-02-21 03:30:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:50,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:50,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {1033#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1192#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:30:50,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1192#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1196#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:50,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} main_#t~short9#1 := main_#t~short7#1; {1196#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:50,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {1196#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1196#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:50,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {1196#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1196#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-21 03:30:50,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {1196#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {1163#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:50,319 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:30:50,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:50,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:50,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,328 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:30:50,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,383 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 55 states and 66 transitions. Complement of second has 7 states. [2022-02-21 03:30:50,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:50,383 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:50,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. cyclomatic complexity: 12 [2022-02-21 03:30:50,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:50,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:50,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:50,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:50,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:50,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 66 transitions. [2022-02-21 03:30:50,384 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:50,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:50,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:50,384 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 49 transitions. cyclomatic complexity: 12 [2022-02-21 03:30:50,386 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:50,386 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:30:50,387 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:50,387 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 66 transitions. cyclomatic complexity: 16 [2022-02-21 03:30:50,402 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:50,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:50,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:50,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:50,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:50,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:50,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:50,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:50,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:50,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 55 letters. Loop has 55 letters. [2022-02-21 03:30:50,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:30:50,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:30:50,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:30:50,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:50,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:50,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:30:50,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:50,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:50,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:30:50,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:50,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:50,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:30:50,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:50,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:50,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:30:50,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:50,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:50,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:50,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:50,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:50,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:50,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:50,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:50,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:30:50,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:50,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:50,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:50,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 7 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:50,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:50,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 49 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 66 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:50,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,422 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:50,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-02-21 03:30:50,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:30:50,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:50,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2022-02-21 03:30:50,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:50,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. cyclomatic complexity: 16 [2022-02-21 03:30:50,424 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:50,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 65 transitions. [2022-02-21 03:30:50,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 03:30:50,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-02-21 03:30:50,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2022-02-21 03:30:50,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:50,425 INFO L681 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-21 03:30:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2022-02-21 03:30:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-02-21 03:30:50,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:50,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states and 65 transitions. Second operand has 53 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,427 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states and 65 transitions. Second operand has 53 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,427 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 53 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,428 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:50,429 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-21 03:30:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-21 03:30:50,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:50,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:50,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states and 65 transitions. [2022-02-21 03:30:50,429 INFO L87 Difference]: Start difference. First operand has 53 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states and 65 transitions. [2022-02-21 03:30:50,430 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:50,431 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-02-21 03:30:50,431 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-21 03:30:50,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:50,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:50,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:50,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:50,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-02-21 03:30:50,432 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-02-21 03:30:50,432 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-02-21 03:30:50,432 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:30:50,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2022-02-21 03:30:50,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:50,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:50,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:50,433 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-02-21 03:30:50,433 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:30:50,433 INFO L791 eck$LassoCheckResult]: Stem: 1274#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; 1290#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 1318#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 1317#L551-3 main_#t~short9#1 := main_#t~short7#1; 1311#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 1309#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1305#L552 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; 1306#L554 assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; 1295#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 1286#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 1287#L551-3 main_#t~short9#1 := main_#t~short7#1; 1289#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 1291#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1307#L552 [2022-02-21 03:30:50,433 INFO L793 eck$LassoCheckResult]: Loop: 1307#L552 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; 1308#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 1316#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 1314#L551-3 main_#t~short9#1 := main_#t~short7#1; 1312#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 1310#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 1307#L552 [2022-02-21 03:30:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash 48967168, now seen corresponding path program 2 times [2022-02-21 03:30:50,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:50,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399846182] [2022-02-21 03:30:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:50,479 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:50,497 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:50,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1695896472, now seen corresponding path program 3 times [2022-02-21 03:30:50,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:50,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402279684] [2022-02-21 03:30:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:50,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:50,508 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:50,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1971308119, now seen corresponding path program 1 times [2022-02-21 03:30:50,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:50,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689195387] [2022-02-21 03:30:50,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:50,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:50,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:50,550 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:50,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:51,371 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:51,372 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:51,372 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:51,372 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:51,372 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:51,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:51,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:51,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:51,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration5_Lasso [2022-02-21 03:30:51,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:51,372 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:51,374 INFO L141 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:30:51,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:51,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:51,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:51,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:51,383 INFO L141 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:30:51,775 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:51,777 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:51,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:51,784 INFO L141 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:30:51,786 INFO L141 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:30:51,788 INFO L141 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:30:51,790 INFO L141 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:30:51,792 INFO L141 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:30:51,795 INFO L141 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:30:51,796 INFO L141 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:30:51,798 INFO L141 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:30:51,800 INFO L141 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:30:51,802 INFO L141 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:30:51,804 INFO L141 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:30:51,806 INFO L141 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:30:51,808 INFO L141 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:30:52,228 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:52,229 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:52,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,230 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:30:52,232 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:30:52,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:52,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:52,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:52,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,256 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:30:52,258 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:30:52,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,296 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:30:52,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-02-21 03:30:52,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,327 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:30:52,329 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:30:52,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:52,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:52,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:52,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:30:52,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,357 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:30:52,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,366 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,366 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,379 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,395 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-02-21 03:30:52,398 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:30:52,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,435 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:30:52,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:52,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,463 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:30:52,465 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:30:52,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,497 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:30:52,499 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:30:52,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:30:52,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,525 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:30:52,527 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:30:52,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-02-21 03:30:52,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,553 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:30:52,555 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:30:52,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-02-21 03:30:52,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,579 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:30:52,581 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:30:52,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,605 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:30:52,607 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:30:52,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,616 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,631 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:30:52,634 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:30:52,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:52,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:52,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:52,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,659 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:30:52,661 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:30:52,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:52,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:52,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:52,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:52,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:52,667 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:52,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:52,674 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:52,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:30:52,676 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:30:52,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:52,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:52,677 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:52,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:30:52,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:52,678 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:30:52,678 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:52,679 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_4 Supporting invariants [] [2022-02-21 03:30:52,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-02-21 03:30:52,781 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2022-02-21 03:30:52,785 INFO L390 LassoCheck]: Loop: "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;" "call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0;" "main_#t~short9#1 := main_#t~short7#1;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0;" "assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" [2022-02-21 03:30:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:52,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:52,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:52,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:52,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:52,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {1527#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1527#unseeded} is VALID [2022-02-21 03:30:52,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1527#unseeded} is VALID [2022-02-21 03:30:52,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#unseeded} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:52,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {1527#unseeded} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:52,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {1527#unseeded} main_#t~short9#1 := main_#t~short7#1; {1527#unseeded} is VALID [2022-02-21 03:30:52,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#unseeded} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:52,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#unseeded} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1527#unseeded} is VALID [2022-02-21 03:30:52,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#unseeded} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1527#unseeded} is VALID [2022-02-21 03:30:52,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#unseeded} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {1527#unseeded} is VALID [2022-02-21 03:30:52,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#unseeded} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:52,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#unseeded} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:52,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {1527#unseeded} main_#t~short9#1 := main_#t~short7#1; {1527#unseeded} is VALID [2022-02-21 03:30:52,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {1527#unseeded} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:52,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {1527#unseeded} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1527#unseeded} is VALID [2022-02-21 03:30:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:52,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:52,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:52,944 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:30:53,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {1704#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)} is VALID [2022-02-21 03:30:53,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {1704#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1708#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:30:53,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1708#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1712#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {1712#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} main_#t~short9#1 := main_#t~short7#1; {1712#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,046 INFO L290 TraceCheckUtils]: 4: Hoare triple {1712#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1712#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1712#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1660#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:53,046 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:30:53,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:53,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,054 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:30:53,054 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,111 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 74 states and 87 transitions. Complement of second has 9 states. [2022-02-21 03:30:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:53,111 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:53,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. cyclomatic complexity: 15 [2022-02-21 03:30:53,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:53,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 87 transitions. [2022-02-21 03:30:53,112 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:53,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,112 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 63 transitions. cyclomatic complexity: 15 [2022-02-21 03:30:53,113 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:53,113 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:53,114 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:53,114 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 87 transitions. cyclomatic complexity: 18 [2022-02-21 03:30:53,115 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:53,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:30:53,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:30:53,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:30:53,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 87 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,139 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-02-21 03:30:53,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,141 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:53,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:53,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {1527#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1527#unseeded} is VALID [2022-02-21 03:30:53,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1527#unseeded} is VALID [2022-02-21 03:30:53,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#unseeded} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {1527#unseeded} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {1527#unseeded} main_#t~short9#1 := main_#t~short7#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#unseeded} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#unseeded} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#unseeded} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#unseeded} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#unseeded} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#unseeded} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {1527#unseeded} main_#t~short9#1 := main_#t~short7#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {1527#unseeded} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {1527#unseeded} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:53,280 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:30:53,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {1852#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)} is VALID [2022-02-21 03:30:53,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {1852#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1856#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:30:53,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {1856#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1860#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {1860#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} main_#t~short9#1 := main_#t~short7#1; {1860#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {1860#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1860#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {1860#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1660#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:53,392 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:30:53,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:53,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-02-21 03:30:53,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,465 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 72 states and 83 transitions. Complement of second has 11 states. [2022-02-21 03:30:53,465 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:30:53,465 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:53,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. cyclomatic complexity: 15 [2022-02-21 03:30:53,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:53,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 83 transitions. [2022-02-21 03:30:53,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-02-21 03:30:53,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,467 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 63 transitions. cyclomatic complexity: 15 [2022-02-21 03:30:53,467 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:53,467 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:53,468 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:53,468 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 72 states and 83 transitions. cyclomatic complexity: 16 [2022-02-21 03:30:53,469 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 72 letters. Loop has 72 letters. [2022-02-21 03:30:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 72 letters. [2022-02-21 03:30:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 72 letters. Loop has 72 letters. [2022-02-21 03:30:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:30:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 4 letters. [2022-02-21 03:30:53,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 72 states and 83 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,489 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-02-21 03:30:53,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,491 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:30:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:53,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {1527#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {1527#unseeded} is VALID [2022-02-21 03:30:53,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1527#unseeded} is VALID [2022-02-21 03:30:53,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#unseeded} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {1527#unseeded} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,549 INFO L290 TraceCheckUtils]: 4: Hoare triple {1527#unseeded} main_#t~short9#1 := main_#t~short7#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#unseeded} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,550 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#unseeded} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#unseeded} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#unseeded} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {1527#unseeded} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {1527#unseeded} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {1527#unseeded} main_#t~short9#1 := main_#t~short7#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {1527#unseeded} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {1527#unseeded} is VALID [2022-02-21 03:30:53,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {1527#unseeded} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1527#unseeded} is VALID [2022-02-21 03:30:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:30:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:53,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:53,632 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 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-21 03:30:53,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#(>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {2001#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)} is VALID [2022-02-21 03:30:53,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {2001#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2005#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:30:53,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {2005#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2009#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {2009#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} main_#t~short9#1 := main_#t~short7#1; {2009#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {2009#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2009#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} is VALID [2022-02-21 03:30:53,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {2009#(and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {1660#(or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-21 03:30:53,795 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:30:53,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:53,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,805 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 4 loop predicates [2022-02-21 03:30:53,805 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,878 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 118 states and 142 transitions. Complement of second has 10 states. [2022-02-21 03:30:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:53,878 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:53,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. cyclomatic complexity: 15 [2022-02-21 03:30:53,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:53,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 142 transitions. [2022-02-21 03:30:53,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:30:53,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 63 transitions. cyclomatic complexity: 15 [2022-02-21 03:30:53,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2022-02-21 03:30:53,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:30:53,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:30:53,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 118 states and 142 transitions. cyclomatic complexity: 29 [2022-02-21 03:30:53,881 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:30:53,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:53,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 118 letters. Loop has 118 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 18 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 17 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 6 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:30:53,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 13 letters. [2022-02-21 03:30:53,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 13 letters. [2022-02-21 03:30:53,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 26 letters. Loop has 13 letters. [2022-02-21 03:30:53,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:53,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:53,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:53,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 13 letters. [2022-02-21 03:30:53,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 13 letters. [2022-02-21 03:30:53,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 27 letters. Loop has 13 letters. [2022-02-21 03:30:53,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:53,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:53,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 63 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:53,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:53,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 118 states and 142 transitions. cyclomatic complexity: 29 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:53,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,897 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-21 03:30:53,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2022-02-21 03:30:53,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:30:53,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 12 letters. [2022-02-21 03:30:53,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:53,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 142 transitions. cyclomatic complexity: 29 [2022-02-21 03:30:53,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:30:53,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 90 states and 103 transitions. [2022-02-21 03:30:53,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-02-21 03:30:53,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-02-21 03:30:53,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 103 transitions. [2022-02-21 03:30:53,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:30:53,908 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-02-21 03:30:53,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 103 transitions. [2022-02-21 03:30:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-02-21 03:30:53,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:30:53,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states and 103 transitions. Second operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,913 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states and 103 transitions. Second operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,913 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,913 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:53,914 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2022-02-21 03:30:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-02-21 03:30:53,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:53,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:53,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 90 states and 103 transitions. [2022-02-21 03:30:53,915 INFO L87 Difference]: Start difference. First operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 90 states and 103 transitions. [2022-02-21 03:30:53,915 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:30:53,916 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2022-02-21 03:30:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-02-21 03:30:53,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:30:53,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:30:53,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:30:53,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:30:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:53,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2022-02-21 03:30:53,918 INFO L704 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-02-21 03:30:53,918 INFO L587 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2022-02-21 03:30:53,918 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:30:53,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2022-02-21 03:30:53,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:30:53,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:53,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:53,918 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:30:53,918 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2022-02-21 03:30:53,918 INFO L791 eck$LassoCheckResult]: Stem: 2151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; 2166#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 2184#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 2181#L551-3 main_#t~short9#1 := main_#t~short7#1; 2178#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 2176#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2173#L552 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; 2174#L554 assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;call main_#t~mem15#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem15#1;call write~int(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1; 2157#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 2158#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 2162#L551-3 main_#t~short9#1 := main_#t~short7#1; 2164#L551-4 [2022-02-21 03:30:53,918 INFO L793 eck$LassoCheckResult]: Loop: 2164#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 2153#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2154#L552 assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; 2167#L554 assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; 2189#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 2210#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 2209#L551-3 main_#t~short9#1 := main_#t~short7#1; 2208#L551-4 assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; 2207#L551-6 assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; 2206#L552 assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; 2160#L554-2 call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; 2161#L551-1 assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; 2216#L551-3 main_#t~short9#1 := main_#t~short7#1; 2164#L551-4 [2022-02-21 03:30:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash -285922666, now seen corresponding path program 2 times [2022-02-21 03:30:53,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:53,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314597545] [2022-02-21 03:30:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:53,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:53,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:53,947 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1998556810, now seen corresponding path program 1 times [2022-02-21 03:30:53,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:53,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466717728] [2022-02-21 03:30:53,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:53,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:53,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:53,977 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 691396865, now seen corresponding path program 1 times [2022-02-21 03:30:53,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:30:53,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391105968] [2022-02-21 03:30:53,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:30:53,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:30:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:54,010 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:30:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:30:54,037 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:30:55,189 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:30:55,189 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:30:55,189 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:30:55,190 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:30:55,190 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:30:55,190 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:55,190 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:30:55,190 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:30:55,190 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration6_Lasso [2022-02-21 03:30:55,190 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:30:55,190 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:30:55,192 INFO L141 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:30:55,195 INFO L141 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:30:55,197 INFO L141 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:30:55,199 INFO L141 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:30:55,201 INFO L141 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:30:55,203 INFO L141 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:30:55,205 INFO L141 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:30:55,207 INFO L141 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:30:55,209 INFO L141 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:30:55,211 INFO L141 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:30:55,676 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:55,678 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:30:55,682 INFO L141 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:30:55,684 INFO L141 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:30:55,686 INFO L141 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:30:55,688 INFO L141 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:30:55,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:55,693 INFO L141 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:30:55,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:30:56,160 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:30:56,160 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:30:56,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,161 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 03:30:56,163 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:30:56,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:56,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,169 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:30:56,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,172 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:30:56,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:56,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-02-21 03:30:56,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,189 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 03:30:56,191 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:30:56,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:56,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:56,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:56,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,217 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:30:56,219 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:30:56,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:56,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:56,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-02-21 03:30:56,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,245 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 03:30:56,247 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:30:56,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:56,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:56,256 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-02-21 03:30:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,272 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 03:30:56,275 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:30:56,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:56,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:56,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:56,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-02-21 03:30:56,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,299 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 03:30:56,301 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:30:56,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:56,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:56,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:56,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,324 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 03:30:56,326 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:56,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:56,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:56,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:56,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-02-21 03:30:56,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,349 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 03:30:56,354 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:30:56,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:56,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:56,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:56,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-02-21 03:30:56,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,376 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:30:56,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-02-21 03:30:56,378 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:30:56,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:30:56,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:30:56,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:30:56,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:56,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,402 INFO L229 MonitoredProcess]: Starting monitored process 71 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:30:56,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-02-21 03:30:56,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:30:56,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,411 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:56,411 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:56,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-02-21 03:30:56,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,431 INFO L229 MonitoredProcess]: Starting monitored process 72 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:30:56,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-02-21 03:30:56,433 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:30:56,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:56,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:56,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-02-21 03:30:56,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,460 INFO L229 MonitoredProcess]: Starting monitored process 73 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:30:56,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-02-21 03:30:56,461 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:30:56,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:56,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:56,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:30:56,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-02-21 03:30:56,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,488 INFO L229 MonitoredProcess]: Starting monitored process 74 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:30:56,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-02-21 03:30:56,490 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:30:56,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:30:56,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:30:56,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:30:56,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:30:56,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:30:56,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:30:56,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:30:56,506 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-02-21 03:30:56,506 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-02-21 03:30:56,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:30:56,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:30:56,507 INFO L229 MonitoredProcess]: Starting monitored process 75 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:30:56,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-02-21 03:30:56,509 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:30:56,515 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:30:56,515 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:30:56,515 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0#1.base) ULTIMATE.start_main_~x~0#1.offset)_5 Supporting invariants [] [2022-02-21 03:30:56,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-02-21 03:30:56,621 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2022-02-21 03:30:56,628 INFO L390 LassoCheck]: Loop: "assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0;" "assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1;" "assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1;" "call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0;" "main_#t~short9#1 := main_#t~short7#1;" "assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0;" "assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1;" "assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1;" "call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0;" "assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0;" "main_#t~short9#1 := main_#t~short7#1;" [2022-02-21 03:30:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:56,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:56,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:30:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:56,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:56,706 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 14 treesize of output 12 [2022-02-21 03:30:56,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {2513#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2513#unseeded} is VALID [2022-02-21 03:30:56,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,796 INFO L290 TraceCheckUtils]: 3: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;call main_#t~mem15#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem15#1;call write~int(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:56,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:30:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:56,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:56,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-02-21 03:30:56,923 INFO L356 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-02-21 03:30:56,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 46 [2022-02-21 03:30:56,949 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-21 03:30:56,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2022-02-21 03:30:57,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:30:58,008 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:30:58,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2022-02-21 03:30:59,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,767 INFO L290 TraceCheckUtils]: 3: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {2699#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {2699#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2699#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {2699#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2706#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))))} is VALID [2022-02-21 03:30:59,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {2706#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))))} main_#t~short9#1 := main_#t~short7#1; {2710#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))))} is VALID [2022-02-21 03:30:59,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {2710#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2714#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {2714#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2714#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {2714#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {2721#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0)) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))))} is VALID [2022-02-21 03:30:59,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {2721#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0)) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2725#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0)) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:30:59,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {2725#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0)) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2729#(and (or (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {2729#(and (or (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2651#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:30:59,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:30:59,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:59,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 17 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-21 03:30:59,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,814 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 03:30:59,814 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:59,881 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 101 transitions. Complement of second has 8 states. [2022-02-21 03:30:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:30:59,881 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:59,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:30:59,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:59,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:59,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:59,881 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:59,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:59,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 101 transitions. [2022-02-21 03:30:59,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:30:59,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:30:59,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:30:59,882 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:30:59,882 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:30:59,882 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:59,883 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:30:59,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 10 transitions. cyclomatic complexity: 9 [2022-02-21 03:30:59,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:30:59,883 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:30:59,883 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 87 states and 101 transitions. cyclomatic complexity: 19 [2022-02-21 03:30:59,883 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:30:59,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:30:59,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:30:59,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:30:59,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:59,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,899 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:30:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:30:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-02-21 03:30:59,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:30:59,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:30:59,899 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:30:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:30:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:59,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:30:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:30:59,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:30:59,965 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 14 treesize of output 12 [2022-02-21 03:31:00,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {2513#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2513#unseeded} is VALID [2022-02-21 03:31:00,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;call main_#t~mem15#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem15#1;call write~int(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:00,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:31:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:00,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:00,170 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:31:00,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 49 [2022-02-21 03:31:00,212 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-21 03:31:00,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2022-02-21 03:31:01,289 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:31:01,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2022-02-21 03:31:02,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:02,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:02,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:02,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {2880#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:02,331 INFO L290 TraceCheckUtils]: 4: Hoare triple {2880#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2880#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:02,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {2880#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2887#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))))} is VALID [2022-02-21 03:31:02,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {2887#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))))} main_#t~short9#1 := main_#t~short7#1; {2891#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))))} is VALID [2022-02-21 03:31:02,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {2891#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2895#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:02,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {2895#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2895#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,340 WARN L290 TraceCheckUtils]: 9: Hoare triple {2895#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {2902#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is UNKNOWN [2022-02-21 03:31:14,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {2902#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2906#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:31:14,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {2906#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2910#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {2910#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2651#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:14,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:14,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 17 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:14,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,355 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 03:31:14,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:14,411 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 87 states and 101 transitions. Complement of second has 8 states. [2022-02-21 03:31:14,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:14,411 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:14,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:31:14,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:14,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:14,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:14,412 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:14,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:14,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 101 transitions. [2022-02-21 03:31:14,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-02-21 03:31:14,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:14,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:14,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:31:14,414 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:31:14,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:14,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:14,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 10 transitions. cyclomatic complexity: 9 [2022-02-21 03:31:14,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:14,414 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:31:14,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 87 states and 101 transitions. cyclomatic complexity: 19 [2022-02-21 03:31:14,415 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:31:14,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:31:14,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:31:14,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 87 letters. Loop has 87 letters. [2022-02-21 03:31:14,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:14,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:14,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:14,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:14,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:14,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:14,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:14,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:14,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:14,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:14,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:14,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:14,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:14,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:14,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:14,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:14,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:14,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:14,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:14,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:14,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:14,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:14,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:14,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:14,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:14,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:14,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:14,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:14,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:14,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:14,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:14,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:14,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:14,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:14,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:14,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:14,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:14,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:14,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:14,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:14,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:14,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:14,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:14,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:14,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:14,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:14,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:14,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:14,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:14,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:14,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:14,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:14,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:14,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:14,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 87 states and 101 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:14,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,430 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-02-21 03:31:14,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:14,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:14,431 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:31:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:14,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:31:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:14,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:14,504 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 14 treesize of output 12 [2022-02-21 03:31:14,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {2513#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2513#unseeded} is VALID [2022-02-21 03:31:14,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,588 INFO L290 TraceCheckUtils]: 3: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;call main_#t~mem15#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem15#1;call write~int(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:14,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:31:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:14,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:14,700 INFO L356 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-02-21 03:31:14,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 46 [2022-02-21 03:31:14,718 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-21 03:31:14,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2022-02-21 03:31:14,792 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:31:15,712 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:31:15,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 72 [2022-02-21 03:31:16,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {3061#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))} is VALID [2022-02-21 03:31:16,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {3061#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {3061#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))} is VALID [2022-02-21 03:31:16,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {3061#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {3068#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {3068#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {3072#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {3072#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {3076#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {3076#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {3076#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {3076#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (or (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (and (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0) (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {3083#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0)) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))))} is VALID [2022-02-21 03:31:16,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {3083#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0)) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {3087#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0)) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:31:16,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {3087#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0)) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {3091#(and (or (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {3091#(and (or (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|)))))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2651#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:16,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:16,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 17 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:16,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,646 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 03:31:16,646 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:16,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 102 states and 118 transitions. Complement of second has 7 states. [2022-02-21 03:31:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:16,721 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:16,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:31:16,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:16,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:16,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:16,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:16,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:16,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 118 transitions. [2022-02-21 03:31:16,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-02-21 03:31:16,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:16,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:16,722 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:31:16,723 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:31:16,723 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:16,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:16,723 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 17 transitions. cyclomatic complexity: 16 [2022-02-21 03:31:16,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:16,723 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:31:16,723 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 102 states and 118 transitions. cyclomatic complexity: 21 [2022-02-21 03:31:16,724 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:31:16,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:31:16,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:31:16,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:31:16,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:16,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:16,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:16,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:16,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:16,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:16,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:16,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:16,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:16,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:16,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:16,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:16,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:16,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:16,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:16,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:16,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:16,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:16,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:16,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:16,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:16,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:16,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:16,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:16,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:16,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:16,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:16,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:16,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:16,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:16,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:16,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:16,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:16,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:16,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:16,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:16,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:16,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:16,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:16,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:16,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:16,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:16,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:16,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,739 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-21 03:31:16,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:16,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:16,740 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:31:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:16,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:31:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:16,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:16,808 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 14 treesize of output 12 [2022-02-21 03:31:16,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {2513#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2513#unseeded} is VALID [2022-02-21 03:31:16,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;call main_#t~mem15#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem15#1;call write~int(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:16,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:31:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:16,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:16,990 INFO L356 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-02-21 03:31:16,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 46 [2022-02-21 03:31:17,009 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-21 03:31:17,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2022-02-21 03:31:17,061 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:31:17,969 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:31:17,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2022-02-21 03:31:18,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:18,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:18,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:18,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {3256#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:18,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {3256#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {3256#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:18,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {3256#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {3263#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))))} is VALID [2022-02-21 03:31:18,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {3263#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))))} main_#t~short9#1 := main_#t~short7#1; {3267#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))))} is VALID [2022-02-21 03:31:18,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {3267#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {3271#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:18,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {3271#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {3271#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {3271#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {3278#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {3278#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {3282#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:31:19,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {3282#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {3286#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {3286#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2651#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:19,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:19,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 17 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:19,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,027 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 03:31:19,027 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:19,095 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 102 states and 118 transitions. Complement of second has 7 states. [2022-02-21 03:31:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:31:19,095 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:19,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:31:19,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:19,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:19,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:19,096 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:19,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:19,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 118 transitions. [2022-02-21 03:31:19,097 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-02-21 03:31:19,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:19,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:19,097 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:31:19,097 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:31:19,098 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:19,098 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:19,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 17 transitions. cyclomatic complexity: 16 [2022-02-21 03:31:19,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:19,098 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:31:19,098 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 102 states and 118 transitions. cyclomatic complexity: 21 [2022-02-21 03:31:19,099 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:31:19,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:31:19,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:31:19,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:31:19,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:19,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:19,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:19,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:19,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:19,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:31:19,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:19,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:19,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:19,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:19,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:19,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:19,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:19,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:19,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:19,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:19,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:19,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:19,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:19,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:19,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:19,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:19,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:19,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:19,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:19,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:19,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:19,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:19,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:19,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:19,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:19,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 118 transitions. cyclomatic complexity: 21 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:19,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,114 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:31:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-21 03:31:19,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:19,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:19,115 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:31:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:31:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:19,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:31:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:19,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:19,201 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 14 treesize of output 12 [2022-02-21 03:31:19,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {2513#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {2513#unseeded} is VALID [2022-02-21 03:31:19,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet10#1, main_#t~mem11#1, main_#t~nondet12#1, main_#t~mem13#1, main_#t~nondet14#1, main_#t~mem15#1, main_#t~nondet16#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~short7#1, main_#t~mem8#1, main_#t~short9#1, main_~x~0#1.base, main_~x~0#1.offset, main_~y~0#1.base, main_~y~0#1.offset, main_~z~0#1.base, main_~z~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~y~0#1.base, main_~y~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);main_~z~0#1.base, main_~z~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet12#1);havoc main_#t~nondet12#1;call main_#t~mem15#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);call write~int(main_#t~mem15#1 - 1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~mem15#1;call write~int(main_#t~nondet16#1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~nondet16#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2648#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) unseeded (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:19,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:31:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:31:19,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:31:19,382 INFO L356 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2022-02-21 03:31:19,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 46 [2022-02-21 03:31:19,424 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-21 03:31:19,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2022-02-21 03:31:19,482 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-21 03:31:20,362 INFO L356 Elim1Store]: treesize reduction 16, result has 63.6 percent of original size [2022-02-21 03:31:20,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 69 [2022-02-21 03:31:21,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:21,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:21,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:21,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {2649#(and (>= oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet12#1;havoc main_#t~nondet12#1;call main_#t~mem13#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);call write~int(main_#t~mem13#1 - 1, main_~y~0#1.base, main_~y~0#1.offset, 4);havoc main_#t~mem13#1;call write~int(main_#t~nondet14#1, main_~z~0#1.base, main_~z~0#1.offset, 4);havoc main_#t~nondet14#1; {3451#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:21,403 INFO L290 TraceCheckUtils]: 4: Hoare triple {3451#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {3451#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:21,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {3451#(and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {3458#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))))} is VALID [2022-02-21 03:31:21,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {3458#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))))} main_#t~short9#1 := main_#t~short7#1; {3462#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))))} is VALID [2022-02-21 03:31:21,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (or (not |ULTIMATE.start_main_#t~short9#1|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|))))))} assume main_#t~short9#1;call main_#t~mem8#1 := read~int(main_~z~0#1.base, main_~z~0#1.offset, 4);main_#t~short9#1 := main_#t~mem8#1 > 0; {3466#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:21,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {3466#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume !!main_#t~short9#1;havoc main_#t~mem5#1;havoc main_#t~mem6#1;havoc main_#t~short7#1;havoc main_#t~mem8#1;havoc main_#t~short9#1; {3466#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:33,416 WARN L290 TraceCheckUtils]: 9: Hoare triple {3466#(and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (<= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) oldRank0)) (and (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|) (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|) 1) oldRank0))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} assume 0 != main_#t~nondet10#1;havoc main_#t~nondet10#1;call main_#t~mem11#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~int(main_#t~mem11#1 - 1, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~mem11#1; {3473#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is UNKNOWN [2022-02-21 03:31:33,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {3473#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} call main_#t~mem5#1 := read~int(main_~x~0#1.base, main_~x~0#1.offset, 4);main_#t~short7#1 := main_#t~mem5#1 > 0; {3477#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} is VALID [2022-02-21 03:31:33,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {3477#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (and (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0) (< 1 oldRank0))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)) (or (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not |ULTIMATE.start_main_#t~short7#1|)))} assume main_#t~short7#1;call main_#t~mem6#1 := read~int(main_~y~0#1.base, main_~y~0#1.offset, 4);main_#t~short7#1 := main_#t~mem6#1 > 0; {3481#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:33,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {3481#(and (or (and (exists ((|ULTIMATE.start_main_~y~0#1.offset| Int) (|ULTIMATE.start_main_~y~0#1.base| Int)) (and (or (not (= |ULTIMATE.start_main_~y~0#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~y~0#1.base|) |ULTIMATE.start_main_~y~0#1.offset|)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) oldRank0)) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) oldRank0)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (< 0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} main_#t~short9#1 := main_#t~short7#1; {2651#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|) (not (= |ULTIMATE.start_main_~z~0#1.base| |ULTIMATE.start_main_#t~malloc2#1.base|)))} is VALID [2022-02-21 03:31:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:31:33,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 17 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-21 03:31:33,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,430 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-02-21 03:31:33,431 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,617 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 300 states and 397 transitions. Complement of second has 27 states 7 powerset states20 rank states. The highest rank that occured is 5 [2022-02-21 03:31:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2022-02-21 03:31:33,619 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2022-02-21 03:31:33,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:31:33,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:33,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:33,619 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,620 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:33,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:33,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 397 transitions. [2022-02-21 03:31:33,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2022-02-21 03:31:33,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:31:33,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:31:33,621 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 67 states and 80 transitions. cyclomatic complexity: 18 [2022-02-21 03:31:33,621 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:31:33,621 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:31:33,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 31 transitions. cyclomatic complexity: 29 [2022-02-21 03:31:33,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:31:33,622 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:31:33,622 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 300 states and 397 transitions. cyclomatic complexity: 107 [2022-02-21 03:31:33,622 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:31:33,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 300 letters. Loop has 300 letters. [2022-02-21 03:31:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 300 letters. Loop has 300 letters. [2022-02-21 03:31:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 300 letters. Loop has 300 letters. [2022-02-21 03:31:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 67 letters. Loop has 67 letters. [2022-02-21 03:31:33,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:31:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:31:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:31:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:33,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 18 letters. Loop has 7 letters. [2022-02-21 03:31:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:33,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:33,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:33,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:33,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:33,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:31:33,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:33,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:33,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:31:33,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:33,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:33,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 14 letters. Loop has 13 letters. [2022-02-21 03:31:33,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:33,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:33,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 16 letters. Loop has 7 letters. [2022-02-21 03:31:33,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:33,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:33,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 21 letters. Loop has 7 letters. [2022-02-21 03:31:33,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:33,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:33,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:31:33,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:33,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:33,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 19 letters. Loop has 7 letters. [2022-02-21 03:31:33,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 67 states and 80 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:33,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:33,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 300 states and 397 transitions. cyclomatic complexity: 107 Stem has 17 letters. Loop has 7 letters. [2022-02-21 03:31:33,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,634 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2022-02-21 03:31:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:31:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-02-21 03:31:33,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 12 letters. Loop has 13 letters. [2022-02-21 03:31:33,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:31:33,636 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:31:33,636 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:31:33,640 INFO L158 Benchmark]: Toolchain (without parser) took 52847.50ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 84.1MB in the beginning and 113.4MB in the end (delta: -29.3MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2022-02-21 03:31:33,641 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 39.5MB in the beginning and 39.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:33,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.89ms. Allocated memory is still 115.3MB. Free memory was 83.8MB in the beginning and 83.9MB in the end (delta: -169.8kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:31:33,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.40ms. Allocated memory is still 115.3MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:31:33,644 INFO L158 Benchmark]: Boogie Preprocessor took 30.42ms. Allocated memory is still 115.3MB. Free memory was 82.0MB in the beginning and 80.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:31:33,644 INFO L158 Benchmark]: RCFGBuilder took 339.75ms. Allocated memory is still 115.3MB. Free memory was 80.6MB in the beginning and 67.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:31:33,644 INFO L158 Benchmark]: BuchiAutomizer took 52140.87ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 67.7MB in the beginning and 113.4MB in the end (delta: -45.7MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2022-02-21 03:31:33,646 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 39.5MB in the beginning and 39.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.89ms. Allocated memory is still 115.3MB. Free memory was 83.8MB in the beginning and 83.9MB in the end (delta: -169.8kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.40ms. Allocated memory is still 115.3MB. Free memory was 83.9MB in the beginning and 82.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.42ms. Allocated memory is still 115.3MB. Free memory was 82.0MB in the beginning and 80.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 339.75ms. Allocated memory is still 115.3MB. Free memory was 80.6MB in the beginning and 67.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 52140.87ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 67.7MB in the beginning and 113.4MB in the end (delta: -45.7MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:785) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:31:33,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient